Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,1

REFERENCES

Arthur Gill, Linear Sequential Circuits, McGraw-Hill, 1966, Eq. (17-10).

FORMULA

G.f.: (1+x^2)/(1+x+x^2+x^3+x^4).

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

CROSSREFS

Sequence in context: A120529 A099443 A132342 this_sequence A106467 A106468 A030317

Adjacent sequences: A156171 A156172 A156173 this_sequence A156175 A156176 A156177

KEYWORD

sign

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Nov 06 2009

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research