Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135585
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135585 a(n) = sum_{i=1..n} [floor( S2(i)/3) mod 2], where S2(i) = A000120(i). +0
2
0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 3, 4, 5, 5, 5, 5, 6, 6, 7, 8, 9, 9, 10, 11, 12, 13, 14, 15, 16, 16, 16, 16, 17, 17, 18, 19, 20, 20, 21, 22, 23, 24, 25, 26, 27, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 41, 41, 41, 41, 42 (list; graph; listen)
OFFSET

0,12

COMMENT

Sequence A115384 is a(n)=sum_{i=1..n}[floor(S2(n)*1/1]mod 2 = sum_{i=1..n} S2(n) mod 2.

MAPLE

A000120 := proc(n) local i ; add(i, i=convert(n, base, 2)) : end: A135585 := proc(n) add(floor(A000120(i)/3) mod 2, i=1..n) ; end: seq(A135585(n), n=0..80) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 22 2008

CROSSREFS

Cf. A115384, A010060.

Sequence in context: A094457 A022820 A069928 this_sequence A081094 A054633 A072490

Adjacent sequences: A135582 A135583 A135584 this_sequence A135586 A135587 A135588

KEYWORD

easy,nonn

AUTHOR

Ctibor O. ZIZKA (ctibor.zizka(AT)seznam.cz), Feb 25 2008

EXTENSIONS

Definition corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 22 2008

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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research