Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025161
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025161 Number of partitions of n with distinct parts p(i) such that if i != j, then |p(i) - p(j)| >= 7. +0
1
1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 10, 11, 12, 14, 15, 17, 19, 21, 23, 26, 28, 31, 34, 37, 40, 44, 47, 51, 55, 59, 63, 68, 73, 78, 84, 90, 97, 104, 112, 120, 130, 139, 150, 161, 174, 186, 201, 215, 232, 248, 267, 285, 307, 327, 351, 374, 401 (list; graph; listen)
OFFSET

1,9

FORMULA

G.f.: Sum(x^(7/2*k^2-5/2*k)/Product(1-x^i, i=1..k), k=1..infinity). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 12 2004

CROSSREFS

Cf. A003114, A025157-A025162.

Adjacent sequences: A025158 A025159 A025160 this_sequence A025162 A025163 A025164

Sequence in context: A110654 A109728 A025162 this_sequence A021895 A026831 A025160

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 27 2002

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research