cp's OEIS Frontend

A276463 Position at which n first appears in A276457, with a(0)=0.

%I A276463 #13 Jul 20 2018 22:28:40
%S A276463 0,2,4,6,8,10,12,14,16,18,20,120,160,158,140,337,171,189,207,165,248,
%T A276463 230,263,122,124,126,128,130,132,134,136,138,244,757,142,144,146,148,
%U A276463 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
%N A276463 Position at which n first appears in A276457, with a(0)=0.
%C A276463 The conjecture is that every number will appear in A276457, so this sequence should be infinite.
%C A276463 1187 doesn't appear in the first 100000 terms of A276457, thus the b-file ends with 1186.
%C A276463 The first 11 terms are successive even numbers (A005843).
%H A276463 Yuriy Sibirmovsky, <a href="/A276463/b276463.txt">Table of n, a(n) for n = 0..1186</a>
%t A276463 Nm=1000;
%t A276463 Aa=Table[0,{j,1,Nm}];
%t A276463 Aa[[3]]=1;
%t A276463 Do[B=Table[IntegerDigits[Aa[[l]]],{l,1,j-1}];
%t A276463 Aa[[j+1]]=SequenceCount[Flatten[B],IntegerDigits[Aa[[j]]]],{j,3,Nm-1}];
%t A276463 Table[Position[Aa,k][[1]]-1,{k,0,50}]
%Y A276463 Cf. A276457, A005843.
%K A276463 nonn,base
%O A276463 0,2
%A A276463 _Yuriy Sibirmovsky_, Sep 04 2016