|
Search: id:A124276
|
|
| |
|
| 1, 6, 18, 20, 42, 54, 60, 100, 126, 136, 156, 162, 180, 220, 294, 300, 342, 378, 408, 420, 468, 486, 500, 540, 620, 660, 680, 780, 820, 882, 900, 1026, 1092, 1100, 1134, 1224, 1260, 1314, 1332, 1404, 1458, 1500, 1620, 1806, 1860, 1980, 2028, 2040, 2058, 2100
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A068563[n] are the numbers n such that 2^n (mod n) = 4^n (mod n). If k is in the sequence A068563 then 2k is also in the sequence A068563, but if 2m is in the sequence A068563 m isn't necessary a term of the sequence A068563.
|
|
EXAMPLE
|
A068563[n] begins {1, 2, 4, 6, 8, 12, 16, 18, 20, 24, 32, 36, 40, 42, ...}.
Thus a(0) = 1, a(1) = 6, a(2) = 18, a(3) = 20, a(4) = 42 because 1/2, 3, 9, 10, 21 are not the terms of A068563[n].
|
|
MAPLE
|
a(0) = 1 for n>0 Select[Range[2, 5000], (PowerMod[2, #, # ]==PowerMod[4, #, # ])&&!(PowerMod[2, #/2, #/2]==PowerMod[4, #/2, #/2])&]
|
|
CROSSREFS
|
Cf. A068563.
Sequence in context: A114452 A108762 A088724 this_sequence A107405 A077663 A025163
Adjacent sequences: A124273 A124274 A124275 this_sequence A124277 A124278 A124279
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Oct 23 2006
|
|
|
Search completed in 0.002 seconds
|
