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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110388 a(n) = F(n)*F(n+1) mod 9, where F(n) = n-th Fibonacci number. 0
1, 2, 6, 6, 4, 5, 3, 3, 7, 8, 0, 0, 1, 2, 6, 6, 4, 5, 3, 3, 7, 8, 0, 0, 1, 2, 6, 6, 4, 5, 3, 3, 7, 8, 0, 0, 1, 2, 6, 6, 4, 5, 3, 3, 7, 8, 0, 0, 1, 2, 6, 6, 4, 5, 3, 3, 7, 8, 0, 0, 1, 2, 6, 6, 4, 5, 3, 3, 7, 8, 0, 0, 1, 2, 6, 6, 4, 5, 3, 3, 7, 8, 0, 0, 1, 2, 6, 6, 4, 5, 3, 3, 7, 8, 0, 0, 1, 2, 6, 6, 4, 5, 3, 3, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..105.

EXAMPLE

a(5) = 5*8 mod 9 = 4.

MAPLE

with(combinat): a:=n->fibonacci(n)*fibonacci(n+1) mod 9: seq(a(n), n=1..130); # Emeric Deutsch, Jul 31 2005

CROSSREFS

Cf. A007887, A001654.

Sequence in context: A319276 A141329 A320953 * A007507 A065486 A069806

Adjacent sequences:  A110385 A110386 A110387 * A110389 A110390 A110391

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy, Jul 27 2005

EXTENSIONS

More terms from Emeric Deutsch, Jul 31 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 14:53 EDT 2019. Contains 327078 sequences. (Running on oeis4.)