login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004065 Define predecessors of n, P(n), to consist of numbers whose binary representation is obtained from that of n by replacing 10 by 01 or changing a final 1 to a 0; then a(0)=1, a(n) = Sum f(P(n)), n>0. 1
1, 1, 1, 1, 1, 2, 2, 2, 1, 3, 5, 7, 5, 12, 12, 12, 1, 4, 9, 16, 14, 42, 54, 66, 14, 56, 110, 176, 110, 286, 286, 286, 1, 5, 14, 30, 28, 100, 154, 220, 42, 198, 462, 858, 572, 1716, 2002, 2288, 42, 240, 702, 1560, 1274, 4550, 6552, 8840, 1274, 5824, 12376 (list; graph; refs; listen; history; internal format)
OFFSET

0,6

EXAMPLE

E.g. 201 = 11001001, so P(201) = {169, 197, 200}, f(201) = f(169) + f(197) + f(200).

CROSSREFS

A003121(n) = a(2^n-1).

Sequence in context: A103626 A026268 A089258 * A127496 A144393 A089400

Adjacent sequences:  A004062 A004063 A004064 * A004066 A004067 A004068

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net) Jan 29 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 18:41 EST 2012. Contains 206074 sequences.