Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A154529
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A154529 A090040 mod 9. +0
2
1, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5, 1, 2, 4, 8, 7, 5 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=(1/30)*{14*(n mod 6)-11*[(n+1) mod 6]-[(n+2) mod 6]+4*[(n+3) mod 6]+29*[(n+4) mod 6]+19*[(n+5) mod 6]}-6*[C(2*n,n) mod 2)], with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Jan 13 2009]

a(n)=a(n-1)-a(n-3)+a(n-4), n>4. G.f.: (6*x^4+2*x^3+4*x+1-4*x^2)/((1-x)*(1+x)*(x^2-x+1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 25 2009]

CROSSREFS

Sequence in context: A120579 A093316 A085758 this_sequence A157823 A159703 A059521

Adjacent sequences: A154526 A154527 A154528 this_sequence A154530 A154531 A154532

KEYWORD

nonn

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Jan 11 2009

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jan 12 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