|
Search: id:A110390
|
|
|
| A110390 |
|
a(n) = F(n) mod s(n) where s(n) is the sum of the digits of the n-th Fibonacci number F(n). |
|
+0
1
|
|
| 1, 0, 6, 5, 4, 0, 1, 3, 1, 3, 13, 0, 9, 21, 6, 14, 13, 9, 13, 2, 1, 18, 18, 9, 1, 9, 2, 3, 30, 0, 12, 21, 38, 3, 27, 38, 2, 3, 2, 13, 3, 18, 34, 1, 5, 3, 28, 0, 1, 21
(list; graph; listen)
|
|
|
OFFSET
|
7,3
|
|
|
EXAMPLE
|
a(9) = 34 mod 7 = 6.
|
|
MATHEMATICA
|
Do[k = Fibonacci[n]; Print[Mod[k, Plus @@ IntegerDigits[k]]], {n, 7, 56}] (Propper)
|
|
CROSSREFS
|
Sequence in context: A143304 A021157 A109063 this_sequence A084448 A085664 A154007
Adjacent sequences: A110387 A110388 A110389 this_sequence A110391 A110392 A110393
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 27 2005
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Aug 14 2005
|
|
|
Search completed in 0.002 seconds
|
