login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 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, 14, 38, 1, 18, 40, 1, 2, 30, 65, 21, 34, 48, 64, 55, 45, 0, 49, 33, 60, 63, 3, 24, 5, 21 (list; graph; refs; listen; history; text; internal format)
OFFSET

7,3

LINKS

Table of n, a(n) for n=7..80.

EXAMPLE

a(9) = 34 mod 7 = 6.

MATHEMATICA

Do[k = Fibonacci[n]; Print[Mod[k, Plus @@ IntegerDigits[k]]], {n, 7, 56}] (* Ryan Propper, Aug 14 2005 *)

Mod[#, Total[IntegerDigits[#]]]&/@Fibonacci[Range[7, 70]] (* Harvey P. Dale, Dec 05 2015 *)

CROSSREFS

Sequence in context: A195713 A306712 A109063 * A193178 A084448 A256596

Adjacent sequences:  A110387 A110388 A110389 * A110391 A110392 A110393

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy, Jul 27 2005

EXTENSIONS

More terms from Ryan Propper, Aug 14 2005

More terms from Harvey P. Dale, Dec 05 2015

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 January 25 19:09 EST 2020. Contains 331249 sequences. (Running on oeis4.)