Search: a332996 -id:a332996
|
|
|
|
0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 2, 1, 2, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 2, 3, 1, 1, 2, 2, 0, 1, 0, 0, 1, 2, 1, 2, 0, 0, 1, 1, 0, 1, 0, 0, 1, 2, 1, 2, 2, 2, 3, 4, 1, 2, 1, 1, 2, 3, 2, 3, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 2, 3, 1, 1, 2, 2, 0, 1, 0, 0, 1, 2, 1, 2, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 2, 3, 1, 1, 2, 2, 2, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,14
|
|
LINKS
|
|
|
FORMULA
|
Conjecture: for n >= 2, a(A086224(n-1)) = n, this being also the first occurrence of each n larger than 1.
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
|
|
0, 1, 2, 2, 4, 5, 4, 5, 8, 8, 10, 11, 8, 8, 10, 10, 16, 17, 16, 17, 20, 20, 22, 23, 16, 17, 16, 16, 20, 21, 20, 21, 32, 32, 34, 35, 32, 32, 34, 34, 40, 41, 40, 41, 44, 44, 46, 47, 32, 32, 34, 34, 32, 33, 32, 32, 40, 40, 42, 43, 40, 40, 42, 42, 64, 65, 64, 65, 68, 68, 70, 71, 64, 65, 64, 64, 68, 69, 68, 69, 80, 80, 82, 83, 80, 80, 82, 82, 88, 89, 88, 89, 92
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
In contrast to similarly constructed A292271, this sequence can be computed directly from the binary expansion of n, without involving primes or their distribution at all.
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
|
|
CROSSREFS
|
Differs from a similarly constructed A292593 for the first time at n=511, where a(511) = 341, while A292593(511) = 340.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
Search completed in 0.009 seconds
|