Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125594
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125594 a(1)=1, a(2)=2, a(3)=4, a(n)=C(C(a(n-1),a(n-2)),C(a(n-1),a(n-2))). +0
1
1, 2, 4, 15, 8885554239441880 (list; graph; listen)
OFFSET

1,2

COMMENT

Next term has 306322 digits. For a(1)=1, a(2)=2, and a(3)=1,2,3, sequence ends with 1's: 1, 2, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1,... 1, 2, 2, 0, 0, 1, 1, 1, 1, 1, 1, 1,... 1, 2, 3, 3, 0, 0, 1, 1, 1, 1, 1, 1,...

MATHEMATICA

a=1; b=2; c=4; s={a, b, c}; Do[d=Binomial[Binomial[c, b], Binomial[b, a]]; AppendTo[s, d]; a=b; b=c; c=d, {3}]; s IntegerDigits[s[[ -1]]]//Length 306322

CROSSREFS

Sequence in context: A065598 A100528 A132483 this_sequence A097542 A094670 A110005

Adjacent sequences: A125591 A125592 A125593 this_sequence A125595 A125596 A125597

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)gmail.com), Jan 05 2007

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research