Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039671
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039671 Row sums up to the main diagonal of the "postage stamp" array (n,m >= 0) defined in A007059. +0
1
1, 1, 3, 8, 21, 53, 130, 310, 724, 1661, 3757, 8398, 18588, 40800, 88918, 192592, 414907, 889631, 1899554, 4040864, 8567342, 18109698, 38176280, 80278798, 168432854, 352658013, 736977583, 1537420460, 3202035086, 6658948608 (list; graph; listen)
OFFSET

0,3

EXAMPLE

a(0)=1, a(1)=0+1=1, a(2)=0+1+2=3, a(3)=0+1+3+4=8

MATHEMATICA

f[ n_, m_ ] := f[ n, m ]=Which[ n>0, Sum[ f[ n-i, m ], {i, 1, m} ], n<0, 0, n==0, 1 ] Table[ Sum[ f[ n, j ], {j, 0, n} ], {n, 0, 30} ]

CROSSREFS

Cf. A007059.

Sequence in context: A096770 A007835 A014396 this_sequence A027930 A038200 A030015

Adjacent sequences: A039668 A039669 A039670 this_sequence A039672 A039673 A039674

KEYWORD

easy,nonn

AUTHOR

Richard L. Ollerton and Eirwyn L. Ollerton (r.ollerton(AT)uws.edu.au)

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research