Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,1

FORMULA

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

G.f.: (-1-x+x^2-x^3+x^4)/(x-1)/(1+x+x^2+x^3+x^4). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 14 2007

CROSSREFS

Sequence in context: A016030 A127252 A121238 this_sequence A070748 A108784 A010555

Adjacent sequences: A131551 A131552 A131553 this_sequence A131555 A131556 A131557

KEYWORD

sign

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Aug 26 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research