Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,1

FORMULA

a(n)=(1/9)*{7*(n mod 3)-8*[(n+1) mod 3]+13*[(n+3) mod 3]}, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), Oct 08 2007

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

G.f.: (2-x+3*x^2)/(1-x^3) [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Mar 24 2009]

PROGRAM

(PARI) a(n)=[2, -1, 3][1+n%3] [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Mar 24 2009]

CROSSREFS

Cf. A130784.

Sequence in context: A076081 A107338 A118123 this_sequence A085014 A082074 A132283

Adjacent sequences: A131753 A131754 A131755 this_sequence A131757 A131758 A131759

KEYWORD

sign,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Oct 04 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 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research