Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136545
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136545 Semi-chaotic binary digit sum/product sequence modeled on a Rudin-Shapiro-type sequence like A014081. +0
2
0, 1, 2, 2, 3, 3, 3, 5, 3, 6, 4, 7, 4, 7, 4, 11, 3, 12, 4, 13, 5, 14, 5, 15, 4, 17, 5, 17, 5, 17, 5, 22, 3, 23, 4, 24, 5, 25, 5, 27, 5, 29, 6, 29, 6, 29, 6, 32, 4, 33 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n)=Sum[1 - Mod[n - Floor[n/2^m], 2]Mod[n - Floor[n/2^(m - 1)], 2],{m, 1, Floor[(n)*Log[2]]}]

MATHEMATICA

Clear[s, k, n] k[n_] := Apply[Plus, Table[1 - Mod[n - Floor[n/2^m], 2]Mod[n - Floor[n/2^(m - 1)], 2], {m, 1, Floor[(n)*Log[2]]}]]; a = Table[k[n], {n, 1, 50}]

CROSSREFS

Cf. A014081.

Adjacent sequences: A136542 A136543 A136544 this_sequence A136546 A136547 A136548

Sequence in context: A110869 A110876 A136132 this_sequence A125843 A147665 A127332

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 24 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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research