Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005403
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005403 Number of protruded partitions of n with largest part at most 2.
(Formerly M2463)
+0
1
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; listen)
OFFSET

1,2

REFERENCES

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: A129361 A062773 A079934 this_sequence A018072 A090170 A054166

Adjacent sequences: A005400 A005401 A005402 this_sequence A005404 A005405 A005406

KEYWORD

nonn

AUTHOR

njas

EXTENSIONS

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

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research