A010065 a(n+1) = a(n) + sum of digits in base 4 representation of a(n), with a(0) = 1.

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

Offset: 0

Author

Leonid Broukhis

Keywords

• nonn
• base

References

• S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 2.24.

Links

• Donovan Johnson, Table of n, a(n) for n = 0..10000
• Index entries for Colombian or self numbers and related sequences

Crossrefs

Cf. A003052, A010061, A010062, A010064, A004207.

Related base-4 sequences: A053737, A230631, A230632, A010064, A230633, A230634, A230635, A230636, A230637, A230638, A010065 (trajectory of 1)

Programs

Haskell

a010065 n = a010065_list !! n
a010065_list = iterate a230631 1  -- Reinhard Zumkeller, Mar 20 2015

Formula

a(n+1) = A230631(a(n)). - Reinhard Zumkeller, Mar 20 2015

Extensions

More terms from Neven Juric, Apr 11 2008