Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053993
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053993 The number phi_2(n) of Frobenius partitions that allow up to 2 repetitions of an integer in a row. +0
1
1, 1, 3, 5, 9, 14, 24, 35, 55, 81, 120, 171, 248, 345, 486, 669, 920, 1246, 1690, 2256, 3014, 3984, 5253, 6870, 8970, 11618, 15022, 19306, 24745, 31557, 40154, 50845, 64244, 80850, 101501, 126982, 158514, 197218, 244865, 303143, 374497, 461435 (list; graph; listen)
OFFSET

1,3

COMMENT

Sum of products of multiplicities of odd parts in all partitions of n+1 (if there are no odd parts in a partition then product of multiplicities is considered to be 1). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 16 2005

REFERENCES

Andrews, George E., Generalized Frobenius partitions, Memoirs of the American Mathematical Society, Number 301, May 1984.

FORMULA

Generating function in Andrews' Memoir

CROSSREFS

Cf. A077285.

Sequence in context: A033818 A120452 A061556 this_sequence A071155 A120695 A116649

Adjacent sequences: A053990 A053991 A053992 this_sequence A053994 A053995 A053996

KEYWORD

easy,nonn

AUTHOR

James A. Sellers (sellersj(AT)math.psu.edu), Apr 04 2000

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research