Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091957
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091957 a(1)=0, a(2)=1, a(n)=A000217(a(n-1)) + A000217(a(n-2)). +0
1
0, 1, 1, 2, 4, 13, 101, 5242, 13747054, 94490767454888, 4464252567107002358694986701, 9964775491460730298984873909049635615687553262572198767 (list; graph; listen)
OFFSET

1,4

PROGRAM

(PARI) t(n)=n*(n+1)/2 v=vector(12) v[2]=1 for (i=3, 12, v[i]=t(v[i-1])+t(v[i-2])) v

CROSSREFS

Sequence in context: A132786 A103845 A055463 this_sequence A056678 A092665 A131758

Adjacent sequences: A091954 A091955 A091956 this_sequence A091958 A091959 A091960

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Mar 13 2004

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research