login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A154811 Fibonacci(2n+1) mod 9. 9
1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Periodic with period length 12. The period 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1 is the palindrom of the one in A153990.

There is some connection to A014217 using the formula with phi=(1+sqrt(5))/2 in A001519.

Terms of the simple continued fraction of 4343150/(sqrt(21657897254981)-1671809). [From Paolo P. Lava (paoloplava(AT)gmail.com), Feb 17 2009]

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (1,0,0,0,0,-1,1).

FORMULA

a(n)= A001519(n+1) mod 9 = A122367(n) mod 9 = |A099496(n)| mod 9.

a(n)=(1/132)*{9*(n mod 12)+20*[(n+1) mod 12]+42*[(n+2) mod 12]-2*[(n+3) mod 12]+42*[(n+4) mod 12]+20*[(n+5) mod 12]+9*[(n+6) mod 12]-2*[(n+7) mod 12]-24*[(n+8) mod 12]+20*[(n+9) mod 12]-24*[(n+10) mod 12]-2*[(n+11) mod 12]}, with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Jan 16 2009]

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

PROG

(PARI) a(n)=fibonacci(n%12*2+1)%9 \\ Charles R Greathouse IV, Dec 21 2011

CROSSREFS

Sequence in context: A085801 A023843 A153990 * A036237 A015948 A119733

Adjacent sequences:  A154808 A154809 A154810 * A154812 A154813 A154814

KEYWORD

nonn,easy

AUTHOR

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

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 23 2009

Corrected typo in A-number in first formula R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 23 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:56 EST 2012. Contains 205860 sequences.