login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Scan first k digits of Pi after decimal point, for k = 1,2,3,..., record all distinct numbers in the order in which they appear.
2

%I #13 Jan 04 2019 10:54:10

%S 1,14,4,141,41,1415,415,15,5,14159,4159,159,59,9,141592,41592,1592,

%T 592,92,2,1415926,415926,15926,5926,926,26,6,14159265,4159265,159265,

%U 59265,9265,265,65,141592653,41592653,1592653,592653,92653,2653,653,53,3,1415926535

%N Scan first k digits of Pi after decimal point, for k = 1,2,3,..., record all distinct numbers in the order in which they appear.

%C Skip any "numbers" that begin with 0, except 0 itself.

%C Presumably this is a permutation of the nonnegative numbers.

%C All the terms of A039916 appear in order in this sequence. - _Rémy Sigrist_, Jan 03 2019

%H Rémy Sigrist, <a href="/A322776/b322776.txt">Table of n, a(n) for n = 1..10000</a>

%o (PARI) pid=Pi-3; s=Set(); for (k=1, 9, pid*=10; my (f=floor(pid)); forstep (w=k, 1, -1, v=f % (10^w); if (!setsearch(s, v), print1 (v ",

%o "); s=setunion(s,Set(v))))) \\ _Rémy Sigrist_, Jan 03 2019

%Y Inspired by A323036.

%Y Cf. A039916, A322777, A154883.

%K nonn,base

%O 1,2

%A _N. J. A. Sloane_, Jan 03 2019

%E More terms from _Rémy Sigrist_, Jan 03 2019