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!)
A039671 Row sums up to the main diagonal of the "postage stamp" array (n,m >= 0) defined in A007059. 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; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
Conjecture: a(n) = Sum_{k=1..n} A126198(n,k), for n > 0. - L. Edson Jeffery, Nov 29 2013
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: A152086 A014396 A170881 * A267946 A166287 A186812
KEYWORD
easy,nonn
AUTHOR
Richard L. Ollerton and Eirwyn L. Ollerton
STATUS
approved

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 19 02:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)