Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067595
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067595 Number of partitions of n into distinct Lucas parts (A000032). +0
3
0, 1, 1, 2, 2, 2, 2, 3, 2, 2, 3, 3, 3, 3, 4, 3, 3, 3, 4, 3, 3, 5, 4, 4, 4, 5, 3, 3, 4, 4, 4, 4, 6, 5, 5, 5, 6, 4, 4, 6, 5, 5, 5, 6, 4, 4, 4, 5, 4, 4, 7, 6, 6, 6, 8, 5, 5, 7, 6, 6, 6, 8, 6, 6, 6, 7, 5, 5, 8, 6, 6, 6, 7, 4, 4, 5, 5, 5, 5 (list; graph; listen)
OFFSET

0,4

CROSSREFS

Adjacent sequences: A067592 A067593 A067594 this_sequence A067596 A067597 A067598

Sequence in context: A061357 A138139 A127992 this_sequence A134868 A127417 A128764

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto (n_nomoto(AT)yabumi.com), Jan 31 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 July 3 11:28 EDT 2009. Contains 160562 sequences.


AT&T Labs Research