login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010065 a(n+1) = a(n) + sum of digits in base 4 representation of a(n), with a(0) = 1. 13
1, 2, 4, 5, 7, 11, 16, 17, 19, 23, 28, 32, 34, 38, 43, 50, 55, 62, 70, 74, 79, 86, 91, 98, 103, 110, 118, 125, 133, 137, 142, 149, 154, 161, 166, 173, 181, 188, 196, 200, 205, 212, 217, 224, 229, 236, 244, 251, 262, 266, 271, 278, 283, 290, 295 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 2.24.
LINKS
FORMULA
a(n+1) = A230631(a(n)). - Reinhard Zumkeller, Mar 20 2015
PROG
(Haskell)
a010065 n = a010065_list !! n
a010065_list = iterate a230631 1 -- Reinhard Zumkeller, Mar 20 2015
CROSSREFS
Related base-4 sequences: A053737, A230631, A230632, A010064, A230633, A230634, A230635, A230636, A230637, A230638, A010065 (trajectory of 1)
Sequence in context: A363045 A022439 A050134 * A344654 A164316 A323146
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
More terms from Neven Juric, Apr 11 2008
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 18:22 EDT 2024. Contains 371750 sequences. (Running on oeis4.)