Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118365
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118365 Limiting difference of the number of infinity-dimensional partitions and m-dimensional partitions of m+n as m tends to infinity. +0
4
0, 1, 3, 9, 28, 88 (list; graph; listen)
OFFSET

2,3

FORMULA

a(n)=A119268(m+n)-A119269(m+n,m)=A119268(m+n)-A119338(m,m+n) for all m>=2n-8. Partial sums of A118364.

CROSSREFS

Cf. A119269, A119338, A119268.

Sequence in context: A085839 A134915 A115239 this_sequence A095716 A124820 A022020

Adjacent sequences: A118362 A118363 A118364 this_sequence A118366 A118367 A118368

KEYWORD

hard,more,nonn

AUTHOR

Max Alekseyev (maxale(AT)gmail.com), May 17 2006

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