|
%I #12 Nov 15 2019 10:46:22
%S 3,1,4,11,5,9,2,6,15,13,25,8,19,7,29,23,12,33,18,14,16,22,26,24,43,53,
%T 28,63,32,17,39,35,0,42,38,48,34,21,49,27,31,36,59,73,69,79,83,37,45,
%U 41,10,55,58,52,20,89,47,44,99,54,64,65,109,62,93,30,57,68,51,46,74,40
%N a(n) = 10*(A064823(n)-1) + A000796(n).
%C The sequence would be a permutation of the naturals if each of the digits 0,1,..,9 occur infinitely often in the decimal expansion of Pi. "Inverse": A065254
%H Reinhard Zumkeller, <a href="/A065253/b065253.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%H <a href="/index/Ph#Pi314">Index entries for sequences related to the number Pi</a>
%t terms = 100; Clear[cnt]; cnt[_] = n = 0;
%t Do[a[++n] = 10 (++cnt[k] - 1) + k, {k, RealDigits[Pi, 10, terms][[1]]}];
%t a /@ Range[terms] (* _Jean-François Alcover_, Nov 15 2019 *)
%o (Haskell)
%o a065253 n = a065253_list !! (n-1)
%o a065253_list = zipWith (+)
%o (map ((* 10) . (subtract 1)) a064823_list) a000796_list
%o -- _Reinhard Zumkeller_, Jul 14 2013
%Y Cf. A064823, A000796, A065254.
%K base,nice,nonn
%O 1,1
%A Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Oct 26 2001
|
