|
|
A276463
|
|
Position at which n first appears in A276457, with a(0)=0.
|
|
1
|
|
|
0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 120, 160, 158, 140, 337, 171, 189, 207, 165, 248, 230, 263, 122, 124, 126, 128, 130, 132, 134, 136, 138, 244, 757, 142, 144, 146, 148, 150, 152, 154, 156, 374, 725, 399, 279, 291, 556, 295, 423, 167, 169, 502, 429, 173, 175, 177, 179, 181, 183, 185, 187, 496, 508, 191, 193, 195, 197
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The conjecture is that every number will appear in A276457, so this sequence should be infinite.
1187 doesn't appear in the first 100000 terms of A276457, thus the b-file ends with 1186.
The first 11 terms are successive even numbers (A005843).
|
|
LINKS
|
|
|
MATHEMATICA
|
Nm=1000;
Aa=Table[0, {j, 1, Nm}];
Aa[[3]]=1;
Do[B=Table[IntegerDigits[Aa[[l]]], {l, 1, j-1}];
Aa[[j+1]]=SequenceCount[Flatten[B], IntegerDigits[Aa[[j]]]], {j, 3, Nm-1}];
Table[Position[Aa, k][[1]]-1, {k, 0, 50}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|