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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140430 Period 6: repeat 3,2,4,1,2,0. 1
3, 2, 4, 1, 2, 0, 3, 2, 4, 1, 2, 0, 3, 2, 4, 1, 2, 0, 3, 2, 4, 1, 2, 0, 3, 2, 4, 1, 2, 0, 3, 2, 4, 1, 2, 0, 3, 2, 4, 1, 2, 0, 3, 2, 4, 1, 2, 0 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Associate to sequence identical to half its p-th differences.

Note main diagonal 3, A000079(n+1). Note also S-E diagonal 4, 1, 5, 7, 17 = 4, A014551(n+1) Jacobsthal-Lucas.

LINKS

Index entries for sequences related to linear recurrences with constant coefficients, signature (1,0,-1,1).

FORMULA

Corresponding square: 3, 2, 4, 1, 2, 0, 3; -1, 2, -3, 1, -2, 3, -1; 3, -5, 4, -3, 5, -4, 3; -8, 9, -7, 8, -9, 7, -8; 17, -16, 15, -17, 16, -15, 17; -33, 31, -32, 33, -31, 32, -33; 64, -63, 65, -64, 63, -65, 64; From -1,first column is A130750 signed, then link with A135356,sequence identical to its p-th differences, recurrence (3, -3, 2);from second 2,second column is A130752 signed,from -3,third column is A130755 signed,suite en trio. 3*A001045(n+1), Jacobsthal, in two South-East diagonals.

a(n)=(1/30)*{-11*(n mod 6)+14*[(n+1) mod 6]-[(n+2) mod 6]+19*[(n+3) mod 6]-6*[(n+4) mod 6]+3*[(n+5) mod 6]}, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Jul 03 2008

PROG

(PARI) a(n)=[3, 2, 4, 1, 2, 0][n%6+1] \\ Charles R Greathouse IV, Jun 02 2011

CROSSREFS

Sequence in context: A127481 A154879 A097673 * A123359 A121885 A122143

Adjacent sequences:  A140427 A140428 A140429 * A140431 A140432 A140433

KEYWORD

nonn,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Jun 25 2008

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 February 17 21:13 EST 2012. Contains 206085 sequences.