Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005404
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005404 Number of protruded partitions of n with largest part at most 3.
(Formerly M2555)
+0
1
1, 3, 6, 12, 22, 42, 75, 135, 238, 416, 719, 1236, 2107, 3574, 6030, 10130, 16950, 28267, 46993, 77916, 128874, 212701, 350375, 576165, 945984, 1551009, 2539790, 4154212, 6787891, 11081022, 18074324, 29458899, 47981563, 78102314, 127060462 (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)^3/Product(1-x-x^i+x^(1+2*i), i=1..3)-1; - Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 19 2004

MAPLE

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

CROSSREFS

Adjacent sequences: A005401 A005402 A005403 this_sequence A005405 A005406 A005407

Sequence in context: A081056 A066982 A018078 this_sequence A097939 A055244 A089068

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research