Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091086
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091086 mod(A000975(n),10). +0
1
0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0, 1, 2, 5, 0 (list; graph; listen)
OFFSET

0,3

COMMENT

A000975(0), A000975(1), A000975(2), A000975(3) repeating.

FORMULA

G.f.: x(1+2x+5x^2)/(1-x^4); E.g.f.: 2exp(x)-exp(-x)-cos(x)-2sin(x); a(n)=2-(-1)^n-cos(pi*n/2)-2sin(pi*n/2).

a(n)=(1/12)*{19*(n mod 4)-5*[(n+1) mod 4]+[(n+2) mod 4]+[(n+3) mod 4]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jul 16 2008

CROSSREFS

Sequence in context: A100085 A065452 A004598 this_sequence A118349 A011183 A005671

Adjacent sequences: A091083 A091084 A091085 this_sequence A091087 A091088 A091089

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 18 2003

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research