Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A160552
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A160552 a(0)=0, a(1)=1; a(2^i+j)=2*a(j)+a(j+1) for 0 <= j < 2^i. +0
24
0, 1, 1, 3, 1, 3, 5, 7, 1, 3, 5, 7, 5, 11, 17, 15, 1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 19, 21, 39, 49, 31, 1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 19, 21, 39, 49, 31, 5, 11, 17, 19, 21, 39, 49, 35, 21, 39, 53, 59, 81, 127, 129, 63, 1, 3, 5, 7, 5, 11, 17, 15, 5, 11, 17, 19, 21, 39, 49, 31 (list; graph; listen)
OFFSET

0,4

COMMENT

This recurrence is patterned after the one for A152980, but without the special cases.

Sequence viewed as triangle:

.0,

.1,

.1,3,

.1,3,5,7,

.1,3,5,7,5,11,17,15,

.1,3,5,7,5,11,17,15,5,11,17,19,21,39,49,31

The rows converge to A151548.

Comment from Gary W. Adamson (qntmpkt(AT)yahoo.com), May 19 2009: If this sequence [1, 1, 3, 1, 3, 5, 7, 1, 3, 5, 7, 5, 11, 17, 15, ...] is convolved with [1, 2, 2, 2, 2, 2, 2, ...) we obtain A139250, the toothpick sequence. Example: A139250(5) = 15 = (1, 2, 2, 2, 2) * (3, 1, 3, 1, 1).

Starting with 1 and convolved with [1, 2, 0, 0, 0,...] = A151548. [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 04 2009]

Refer to A162956 for the analogous triangle using N=3. [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jul 20 2009]

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 0..16384

FORMULA

G.f.: x*(1+2*x)/(1+x) + (4*x^2/(1+2*x))*(mul(1+x^(2^k-1)+2*x^(2^k),k=1..oo)-1). - N. J. A. Sloane, May 23 2009, based on Gary Adamson's comment above and the known g.f. for A139250.

H := x*(1+2*x)/(1+x) + (4*x^2/(1+2*x))*(mul(1+x^(2^k-1)+2*x^(2^k),k=1..20)-1); # - N. J. A. Sloane, May 23 2009

EXAMPLE

a(2) = a(2^1+0) = 2a(0)+a(1) = 1, a(3) = a(2^1+1) = 2a(1) + a(2) = 3 a(2^i) = 2a(0) + a(1) = 1

MAPLE

S:=proc(n) option remember; local i, j; if n <= 1 then RETURN(n); fi; i:=floor(log(n)/log(2)); j:=n-2^i; 2*S(j)+S(j+1); end; [from N. J. A. Sloane, May 18 2009]

CROSSREFS

For the recurrence a(2^i+j) = C*a(j) + D*a(j+1), a(0) = A, a(1) = B for following values of (A B C D) see: (0 1 1 1) A118977, (1 0 1 1) A151702, (1 1 1 1) A151570, (1 2 1 1) A151571, (0 1 1 2) A151572, (1 0 1 2) A151703, (1 1 1 2) A151573, (1 2 1 2) A151574, (0 1 2 1) A160552, (1 0 2 1) A151704, (1 1 2 1) A151568, (1 2 2 1) A151569, (0 1 2 2) A151705, (1 0 2 2) A151706, (1 1 2 2) A151707, (1 2 2 2) A151708.

Cf. A152980, A139250, A139251, A151548, A160570, A151568.

A162956 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jul 20 2009]

Sequence in context: A016471 A082082 A016646 this_sequence A006257 A114144 A050820

Adjacent sequences: A160549 A160550 A160551 this_sequence A160553 A160554 A160555

KEYWORD

nonn,tabf

AUTHOR

David Applegate (david(AT)research.att.com), May 18 2009

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 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research