Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130848
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130848 Periodic sequence with period (2, 5, 3, -2, -5, -3). +0
1
2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3, 2, 5, 3, -2, -5, -3 (list; graph; listen)
OFFSET

0,1

COMMENT

Also binomial transform of periodic sequence with period (2, 3, -5).

Sequence is identical to its third differences.

FORMULA

a(0) = 2; a(1) = 5; for n > 1, a(n) = a(n-1)-a(n-2).

a(0) = 2; a(1) = 5; a(2) = 3; a(3) = -2; a(4) = -5; a(5) = -3; for n > 5, a(n) = a(n-6).

G.f.: (2+3*x)/(1-x+x^2).

a(n)=(1/6)*{-5*(n mod 6)-2*[(n+1) mod 6]+3*[(n+2) mod 6]+5*[(n+3) mod 6]+2*[(n+4) mod 6]-3*[(n+5) mod 6]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Aug 01 2007

a(n) = 2*cos(1/3*Pi*n)+8/3*3^(1/2)*sin(1/3*Pi*n). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 15 2007

PROGRAM

(PARI) {m=104; a=2; b=5; print1(a=2, ", ", b=5, ", "); for(n=2, m, print1(c=b-a, ", "); a=b; b=c)} /* Klaus Brockhaus, Jul 30 2007 */

(MAGMA) m:=105; [ [2, 5, 3, -2, -5, -3][ (n-1) mod 6 + 1 ]: n in [1..m] ]; /* Klaus Brockhaus, Jul 30 2007 */

CROSSREFS

Sequence in context: A076840 A078375 A065261 this_sequence A156637 A163766 A004200

Adjacent sequences: A130845 A130846 A130847 this_sequence A130849 A130850 A130851

KEYWORD

sign

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Jul 21 2007

EXTENSIONS

Edited by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jul 30 2007

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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research