Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,4

COMMENT

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

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

FORMULA

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

CROSSREFS

Sequence in context: A112274 A082054 A044943 this_sequence A127504 A047917 A000360

Adjacent sequences: A102392 A102393 A102394 this_sequence A102396 A102397 A102398

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research