Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064660
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064660 Form a conjugate partition of row with 1 in first row. all other rows are the union of their parents. n-th row sum is equal to 2^(n-1). The largest part of n-th row is A000045(n). a(n) = number of types of piles in n-th row. +0
1
1, 1, 2, 3, 4, 6, 8, 11, 15, 22, 30, 39, 53, 75, 106, 151 (list; graph; listen)
OFFSET

1,3

EXAMPLE

(first row: 1 and the other conjugate partition is 1; 2nd row is union of 1 and 1.) (2nd row: 1+1 and the other conjugate partition is 2; 3rd row is union of 1+1 and 2.) (3rd row: 2+1+1 and the other conjugate partition is 3+1; 4th row is union of 2+1+1 and 3+1.)

CROSSREFS

Cf. A000700, A000701, A000045.

Sequence in context: A064323 A003411 A034081 this_sequence A066806 A057048 A017911

Adjacent sequences: A064657 A064658 A064659 this_sequence A064661 A064662 A064663

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 14 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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research