|
Search: id:A078610
|
|
|
| A078610 |
|
Least m such that B(n!) = B(n!+m), where B(n) is the sum of binary digits of n. |
|
+0
1
|
|
| 1, 2, 3, 9, 15, 16, 17, 129, 129, 271, 256, 1055, 1025, 2048, 2049, 32769, 32769, 65537, 65536, 262144, 262144, 524289, 524288, 4194307, 4194311, 8388609, 8388608, 33554435, 33554433, 67108864, 67108865, 2147483649, 2147483649, 4294967297
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(6)=16 because 6! = [1, 0, 1, 1, 0, 1, 0, 0, 0, 0] and 6!+16 = [1, 0, 1, 1, 1, 0, 0, 0, 0, 0].
|
|
CROSSREFS
|
Cf. A000120.
Sequence in context: A026307 A139816 A083303 this_sequence A108825 A109663 A056702
Adjacent sequences: A078607 A078608 A078609 this_sequence A078611 A078612 A078613
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Dec 09 2002
|
|
EXTENSIONS
|
More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 04 2003
|
|
|
Search completed in 0.002 seconds
|
