This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Yuriy Sibirmovsky, Table of n, a(n) for n = 0..1186 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 Cf. A276457, A005843. Sequence in context: A134930 A084562 A240714 * A187350 A118070 A276128 Adjacent sequences:  A276460 A276461 A276462 * A276464 A276465 A276466 KEYWORD nonn,base AUTHOR Yuriy Sibirmovsky, Sep 04 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 13 20:06 EST 2018. Contains 318087 sequences. (Running on oeis4.)