Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,1

FORMULA

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

a(n)=11*(-1)^n/3-2*A010892(n)/3+7*A010892(n-1)/3, n>0. a(n+6)=a(n). G.f.: (3-2x+6x^2)/((1+x)(1-x+x^2)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 24 2008]

CROSSREFS

Sequence in context: A092843 A078589 A077880 this_sequence A058971 A137324 A011209

Adjacent sequences: A131966 A131967 A131968 this_sequence A131970 A131971 A131972

KEYWORD

sign

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Oct 06 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 December 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research