Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136546
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136546 Three-part semi-chaotic binary digit sum/product sequence modeled on a Rudin-Shapiro-type sequence like A014081. +0
2
0, 0, 1, 1, 1, 3, 3, 4, 4, 4, 5, 7, 7, 8, 9, 10, 9, 10, 11, 11, 11, 13, 13, 15, 15, 16, 16, 18, 18, 19, 20, 21, 20, 21, 22, 22, 22, 24, 25, 25, 25, 26, 26, 28, 28, 29, 30, 32, 31, 32 (list; graph; listen)
OFFSET

1,6

FORMULA

a(n)=Sum[1 - Mod[n - Floor[n/2^m], 2] + 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], 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: A136543 A136544 A136545 this_sequence A136547 A136548 A136549

Sequence in context: A061023 A057690 A090972 this_sequence A058729 A021303 A130250

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