|
Search: id:A068563
|
|
|
| A068563 |
|
Numbers n such that 2^n (mod n) = 4^n (mod n). |
|
+0
5
|
|
| 1, 2, 4, 6, 8, 12, 16, 18, 20, 24, 32, 36, 40, 42, 48, 54, 60, 64, 72, 80, 84, 96, 100, 108, 120, 126, 128, 136, 144, 156, 160, 162, 168, 180, 192, 200, 216, 220, 240, 252, 256, 272, 288, 294, 300, 312, 320, 324, 336, 342, 360, 378, 384, 400, 408, 420, 432, 440
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
If k is in the sequence then 2k is also in the sequence, but the converse is not true.
Numbers n such that lambda(n) divides n, where lambda(n) is Carmichael's lambda function, A002322. - T. D. Noe (noe(AT)sspectra.com), May 30 2003
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Carmichael Function
|
|
MATHEMATICA
|
Flatten[Position[Table[n/CarmichaelLambda[n], {n, 440}], _Integer]]
|
|
CROSSREFS
|
Cf. A002322.
Sequence in context: A125225 A092903 A005153 this_sequence A124240 A068997 A067712
Adjacent sequences: A068560 A068561 A068562 this_sequence A068564 A068565 A068566
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 25 2002
|
|
|
Search completed in 0.002 seconds
|
