login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080425 Jacobsthal selector sequence. 12
0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

The Jacobsthal sequence A001045 can be defined by A001045(n)=Sum{k=0..floor(n,3), binomial(n, A080425(n-1)+3k)}

a(n) = A130196(n) + A131534(n) - 2. [From Reinhard Zumkeller, Nov 12 2009]

LINKS

Table of n, a(n) for n=0..104.

FORMULA

a(n)=ceiling((mod(n, 3)+1)/2)+(-1)^(mod(n, 3)+1)

G.f.: x(x+2)/(1-x^3) - Paul Barry, May 25 2003

a(n) = (3 - n mod 3) mod 3. - Reinhard Zumkeller, Jul 30 2005

a(n)=2*A001045(L(n/3)), where L(j/p) is the Legendre symbol of j and p.

a(n)=(-n) mod 3; also a(n)=3*ceiling(n/3)-n. - Hieronymus Fischer, May 29 2007

MAPLE

[seq (modp((2*n+1), 3), n=1..90)]; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 01 2006

PROG

(Haskell)

a080425 = (`mod` 3) . (3 -) . (`mod` 3)

a080425_list = cycle [0, 2, 1]  -- Reinhard Zumkeller, Feb 22 2013

CROSSREFS

Cf. A001045, A007318.

Cf. A010872.

Sequence in context: A112203 A196279 A132798 * A048141 A025664 A025854

Adjacent sequences:  A080422 A080423 A080424 * A080426 A080427 A080428

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Feb 20 2003

EXTENSIONS

More terms from Reinhard Zumkeller, Jul 30 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 19 13:36 EDT 2013. Contains 226411 sequences.