Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102396
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102396 A mod 2 related Jacobsthal sequence. +0
2
0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 3, 3, 5, 1, 1, 1, 3, 1, 3, 3, 5, 1, 3, 3, 5, 3, 5, 5, 11, 1, 1, 1, 3, 1, 3, 3, 5, 1, 3, 3, 5, 3, 5, 5, 11, 1, 3, 3, 5, 3, 5, 5, 11, 3, 5, 5, 11, 5, 11, 11, 21, 1, 1, 1, 3, 1, 3, 3, 5, 1, 3, 3, 5, 3, 5, 5, 11, 1, 3, 3, 5, 3, 5, 5, 11, 3, 5, 5, 11, 5, 11, 11, 21, 1, 3 (list; graph; listen)
OFFSET

0,8

COMMENT

a(2^n-1)=A001045(n). Conjecture : all elements a(n) are Jacobsthal numbers. A001316(n)=A102395(n)+2*A102396(n).

The conjecture is true since a(n)=A001045(A000120(n)). - Paul Barry (pbarry(AT)wit.ie), Jan 07 2005

FORMULA

a(n)=sum{k=0..n, if(mod(n+k, 3)=1, C(n, k) mod 2, 0)}; a(n)=sum{k=0..n, if(mod(n+k, 3)=2, C(n, k) mod 2, 0)}.

a(n)=(1/2)*sum(k=0, n, {F(n+k)*binomial(n, k)} mod 2) where F=A000045; recurrence : a(0)=0 then a(2n)=a(n) and a(2n+1)=2*a(n)+1-2*t(n) where t(n)=A010060(n) is the Thue-Morse sequence - Benoit Cloitre (benoit7848c(AT)orange.fr), May 15 2005

CROSSREFS

Sequence in context: A095345 A132468 A090176 this_sequence A095960 A029356 A114006

Adjacent sequences: A102393 A102394 A102395 this_sequence A102397 A102398 A102399

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jan 06 2005

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