login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152158 A sequence set up on the first 1000 base ten Pi digits: a(n)=a(n-1)+a(n-2)*Floor[Mod[N[Pi*10^(n - 2), 1000], 10]]. 1

%I #10 Feb 25 2017 18:28:24

%S 0,1,1,2,6,8,38,110,186,846,1776,4314,13194,47706,166452,500394,

%T 1998462,3499644,7496568,17995500,77968044,149950044,617758308,

%U 917658396,4624208244,8294841828,22167466560,47051992044,224391724524

%N A sequence set up on the first 1000 base ten Pi digits: a(n)=a(n-1)+a(n-2)*Floor[Mod[N[Pi*10^(n - 2), 1000], 10]].

%C The idea here is to associate a normal Hermite type distribution of the sort: a(n)=a(n-1)+f(n-2)*a(n-2); with the Pi digits.

%H G. C. Greubel, <a href="/A152158/b152158.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) = a(n-1) + a(n-2)*floor( Pi*10^(n-2) mod 10 ).

%t Clear[a, n]; a[0] = 0; a[1] = 1; a[n_] := a[n] = a[n - 1] + Floor[Mod[N[Pi*10^(n - 2), 1000], 10]]*a[n - 2]; Table[a[n], {n, 0, 30}]

%K nonn,base

%O 0,4

%A _Roger L. Bagula_ and _Alexander R. Povolotsky_, Nov 27 2008

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:16 EDT 2024. Contains 371906 sequences. (Running on oeis4.)