(Translated by https://www.hiragana.jp/)
A250209 - OEIS
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A250209 a(n) = least k such that k * n is in A072226, or 0 if no such k exists. 1
2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 5, 1, 2, 2, 1, 2, 1, 6, 1, 1, 2, 5, 1, 1, 1, 1, 1, 8, 34, 8, 1, 2, 1, 10, 1, 2, 350, 2, 1, 111, 4, 1, 3, 16, 4, 15, 28, 3, 1, 206, 3, 10, 2, 1, 1, 2, 3, 1, 15, 637, 12, 1, 4, 22, 17, 104, 4, 2, 1012, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Conjecture: a(n) > 0 for all n.
Numbers n such that n * a(n) > 10^5, a(n) is currently unknown for n = 121, 124, 130, 143, 144, 162, 164, 171, 172, 185, 188, 197, 201, 215, ...
a(121) = (A117545(2048))/11 and they are both currently unknown.
A117545(2^n) = a(A064549(n)).
LINKS
MATHEMATICA
Table[k=1; while[!PrimeQ[Cyclotomic[n*k, 2]], k++]; k, {n, 150}]
PROG
(PARI) a(n) = {k = 1; while (!isprime(polcyclo(k*n, 2)), k++); k; } \\ Michel Marcus, Jan 18 2015
CROSSREFS
Sequence in context: A160094 A043283 A127937 * A280010 A167852 A184340
KEYWORD
nonn
AUTHOR
Eric Chen, Jan 18 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 23 15:25 EDT 2024. Contains 374552 sequences. (Running on oeis4.)