Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102425
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102425 Let pi be an unrestricted partition of n with the summands written as binary numbers; a(n) is the number of such partitions with an even number of binary ones. +0
1
0, 1, 2, 2, 4, 6, 6, 12, 16, 20, 28, 40, 48, 69, 91, 111, 150, 197, 238, 319, 398, 493, 634, 792, 968, 1226, 1510, 1846, 2293, 2811 (list; graph; listen)
OFFSET

1,3

EXAMPLE

a(5)=4 because there are 4 partitions of 5 whose binary representations have an even number of binary ones, namely 101, 100+1, 11+1+1, 10+1+1+1.

CROSSREFS

Sequence in context: A065457 A000784 A092991 this_sequence A162608 A143216 A086536

Adjacent sequences: A102422 A102423 A102424 this_sequence A102426 A102427 A102428

KEYWORD

nonn

AUTHOR

David Newman (DavidSNewman(AT)hotmail.com), Feb 23 2005

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research