Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067590
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067590 Number of partitions of n into odious numbers (A000069). +0
3
0, 1, 2, 2, 4, 4, 6, 7, 11, 12, 16, 19, 25, 29, 37, 44, 56, 64, 79, 92, 112, 130, 157, 182, 217, 250, 296, 341, 401, 461, 539, 615, 717, 817, 945, 1076, 1240, 1409, 1614, 1830, 2091, 2365, 2692, 3040, 3451, 3885, 4398, 4942, 5581, 6260, 7050, 7896 (list; graph; listen)
OFFSET

0,3

LINKS

N. J. A. Sloane, Transforms

FORMULA

Euler Transform of characteristic function of A000069.

CROSSREFS

Cf. A067591, A116492.

Sequence in context: A027590 A027595 A007212 this_sequence A027188 A089076 A123067

Adjacent sequences: A067587 A067588 A067589 this_sequence A067591 A067592 A067593

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto (n_nomoto(AT)yabumi.com), Jan 31 2002

page 1

Search completed in 0.005 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research