Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152158
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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]]. +0
1
0, 1, 1, 2, 6, 8, 38, 110, 186, 846, 1776, 4314, 13194, 47706, 166452, 500394, 1998462, 3499644, 7496568, 17995500, 77968044, 149950044, 617758308, 917658396, 4624208244, 8294841828, 22167466560, 47051992044, 224391724524 (list; graph; listen)
OFFSET

0,4

COMMENT

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.

FORMULA

a(n)=a(n-1)+a(n-2)*Floor[Mod[N[Pi*10^(n - 2), 1000], 10]].

MATHEMATICA

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}]

CROSSREFS

Sequence in context: A076507 A117542 A045653 this_sequence A095239 A065953 A118211

Adjacent sequences: A152155 A152156 A152157 this_sequence A152159 A152160 A152161

KEYWORD

nonn

AUTHOR

Roger L. Bagula and Alexander R. Povolotsky (rlbagulatftn(AT)yahoo.com), Nov 27 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research