Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114482
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114482 Let S(1)=1, S(2)=10; S(2n)=concatenation of S(2n-1), S(2n-2) and 0; and S(2n+1)=concatenation of S(2n), S(2n) and 0. Sequence gives S(infinity). +0
4
1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0 (list; graph; listen)
OFFSET

1,1

COMMENT

Number of terms in S(n) is A062318(n).

Interpreting S(n) in binary and converting to decimal gives 1,2,20,164,84296,43159880,5792821120672400,...,.

EXAMPLE

S(3) = {1,0,1,0,0}, S(4) = {1,0,1,0,0,1,0,0}, S(5) = {1,0,1,0,0,1,0,0,1,0,1,0,0,1,0,0,0}, ...

MATHEMATICA

a[1] = {1}; a[2] = {1, 0}; a[n_] := a[n] = If[EvenQ[n], Join[a[n - 1], a[n - 2], {0}] // Flatten, Join[a[n - 1], a[n - 1], {0}] // Flatten]; a[8] (Robert G. Wilson v)

CROSSREFS

Cf. A114483, A112346, A112361.

Adjacent sequences: A114479 A114480 A114481 this_sequence A114483 A114484 A114485

Sequence in context: A134286 A023531 A089495 this_sequence A127829 A127831 A105385

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Nov 30 2005

EXTENSIONS

More terms from Robert G. Wilson v, Jan 01 2006

Edited by njas, Jan 03 2006

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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research