login
This site is supported by donations 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. 11

%I

%S 1,2,4,5,7,11,16,17,19,23,28,32,34,38,43,50,55,62,70,74,79,86,91,98,

%T 103,110,118,125,133,137,142,149,154,161,166,173,181,188,196,200,205,

%U 212,217,224,229,236,244,251,262,266,271,278,283,290,295

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

%D S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 2.24.

%H Donovan Johnson, <a href="/A010065/b010065.txt">Table of n, a(n) for n = 0..10000</a>

%H <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a>

%F a(n+1) = A230631(a(n)). - _Reinhard Zumkeller_, Mar 20 2015

%o (Haskell)

%o a010065 n = a010065_list !! n

%o a010065_list = iterate a230631 1 -- _Reinhard Zumkeller_, Mar 20 2015

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

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

%K nonn,base

%O 0,2

%A _Leonid Broukhis_

%E More terms from Neven Juric, Apr 11 2008

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 November 14 09:51 EST 2019. Contains 329111 sequences. (Running on oeis4.)