Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,4

FORMULA

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

a(n)=1/30*{17*(n mod 6)-13[(n+1) mod 6]+12*[(n+2) mod 6]-3*[(n+3) mod 6]-3*[(n+4) mod 6]+2*[(n+5) mod 6]} with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Nov 27 2006

PROGRAM

Floretion Algebra Multiplication Program, FAMP Code: 1em[I]sumseq[ - .25'i - .5'j - .25i' - .5j' + .25'ii' + .25'jj' - .75'kk' + .25'jk' + .25'kj' + .25e]; sumtype: (Y[15], *, sum)

CROSSREFS

Sequence in context: A080024 A035199 A035229 this_sequence A085246 A035182 A141700

Adjacent sequences: A109359 A109360 A109361 this_sequence A109363 A109364 A109365

KEYWORD

easy,nonn

AUTHOR

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Aug 22 2005

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