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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028841 Iterated sum of digits of n is a Fibonacci number. 3
1, 2, 3, 5, 8, 10, 11, 12, 14, 17, 19, 20, 21, 23, 26, 28, 29, 30, 32, 35, 37, 38, 39, 41, 44, 46, 47, 48, 50, 53, 55, 56, 57, 59, 62, 64, 65, 66, 68, 71, 73, 74, 75, 77, 80, 82, 83, 84, 86, 89, 91, 92, 93, 95, 98, 100, 101, 102, 104, 107, 109, 110, 111, 113, 116, 118, 119 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Harvey P. Dale, Table of n, a(n) for n = 0..1000

EXAMPLE

E.g. 98 -> 9+8 = 17 -> 1+7 = 8 is a Fibonacci number.

MATHEMATICA

With[{f={1, 2, 3, 5, 8}}, Select[Range[120], MemberQ[f, NestWhile[Total[ IntegerDigits[#]]&, #, #>9&]]&]] (* Harvey P. Dale, Apr 11 2013 *)

CROSSREFS

Cf. A010888, A028840, A028891.

Sequence in context: A272669 A028770 A028800 * A028840 A189143 A047605

Adjacent sequences:  A028838 A028839 A028840 * A028842 A028843 A028844

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane.

EXTENSIONS

More terms from Patrick De Geest, Jun 15 1999.

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified March 26 10:42 EDT 2017. Contains 284111 sequences.