Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135993
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135993 a(0)=0; a(n)=(floor(n/S2(n))) mod 2, where S2(n) is the binary weight of n. +0
2
0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1 (list; graph; listen)
OFFSET

0,1

REFERENCES

J.-P. Allouche,J. Shallit and J. Sondow, Summation of Series Defined by Counting Blocks of Digits. http://arXiv.org/PS_cache/math/pdf/0512/0512399v2.pdf

J. Sondow and P. Hadjicostas :The Generalized-Euler-Constant Function (z) and a Generalization of Somos's Quadratic Recurrence Constant. http://arXiv.org/PS_cache/math/pdf/0610/0610499v1.pdf

EXAMPLE

a(17)=(floor(17/2))mod 2 = 0

a(18)=(floor(18/2))mod 2 = 1

CROSSREFS

Cf. A010060, A007953.

Sequence in context: A083923 A101309 A073424 this_sequence A092202 A082848 A141743

Adjacent sequences: A135990 A135991 A135992 this_sequence A135994 A135995 A135996

KEYWORD

easy,nonn

AUTHOR

Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Mar 03 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research