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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096289 Let n=Sum(c(k)*2^k), c(k)=0,1, be the binary form of n, n=Sum(d(k)*5^k), d(k)=0,1,2,3,4 the base 5 form; then a(n)=Sum(c(k)+d(k)). 1
0, 2, 3, 5, 5, 3, 4, 6, 5, 7, 4, 6, 6, 8, 9, 7, 5, 7, 8, 10, 6, 8, 9, 11, 10, 4, 5, 7, 7, 9, 6, 8, 5, 7, 8, 6, 6, 8, 9, 11, 6, 8, 9, 11, 11, 9, 10, 12, 10, 12, 5, 7, 7, 9, 10, 8, 7, 9, 10, 12, 8, 10, 11, 13, 9, 7, 8, 10, 10, 12, 9, 11, 10, 12, 13, 7, 7, 9, 10, 12, 6, 8, 9, 11, 11, 9, 10, 12, 11, 13 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

a(n) mod 2 = doubled Thue-Morse sequence A095190

EXAMPLE

n=13: 13=1*2^3+1*2^2+1*2^0, 1+1+1=3, 13=2*5^1+3*5^0, 2+3=5

so a(13)=3+5=8.

CROSSREFS

Cf. A095190, A010059, A010060.

Sequence in context: A096099 A019780 A133293 * A131295 A102642 A183228

Adjacent sequences:  A096286 A096287 A096288 * A096290 A096291 A096292

KEYWORD

easy,nonn

AUTHOR

Miklos Kristof, Peter Boros (kristmikl(AT)freemail.hu), Jun 24 2004

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 16 13:12 EST 2012. Contains 205909 sequences.