login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005403 Number of protruded partitions of n with largest part at most 2.
(Formerly M2463)
0
1, 3, 5, 10, 17, 31, 53, 92, 156, 265, 445, 746, 1243, 2066, 3421, 5652, 9314, 15320, 25152, 41232, 67497, 110361, 180249, 294115, 479500, 781143, 1271675, 2068987, 3364358, 5468074, 8883329, 14425997, 23418648, 38004865, 61658326, 100007327 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. P. Stanley, A Fibonacci lattice, Fib. Quart., 13 (1975), 215-232.

R. P. Stanley, Ordered structures and partitions, Memoirs of the Amer. Math. Soc., no. 119 (1972).

FORMULA

G.f. = (1-x)^2/Product(1-x-x^i+x^(1+2*i), i=1..2)-1; - Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 19 2004

MAPLE

G:=(1-x)^2/Product(1-x-x^i+x^(1+2*i), i=1..2)-1: Gser:=series(G, x=0, 39): seq(coeff(Gser, x^n), n=1..37); (Deutsch)

CROSSREFS

Sequence in context: A062773 A192757 A079934 * A018072 A090170 A054166

Adjacent sequences:  A005400 A005401 A005402 * A005404 A005405 A005406

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 19 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 07:10 EST 2012. Contains 205874 sequences.