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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A232228 a(1)=1; thereafter a(n) = 2^(number of bits in binary expansion of a(n-1)) + 1 + a(n-1). 2
 1, 4, 13, 30, 63, 128, 385, 898, 1923, 3972, 8069, 16262, 32647, 65416, 130953, 262026, 524171, 1048460, 2097037, 4194190, 8388495, 16777104, 33554321, 67108754, 134217619, 268435348, 536870805, 1073741718, 2147483543, 4294967192, 8589934489, 17179869082, 34359738267, 68719476636 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS An infinite subsequence of A010061. LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1001 D. W. Bange, Solution to Problem E 2408, Amer. Math. Monthly, 81 (1974), 407. Index entries for Colombian or self numbers and related sequences MAPLE f:=proc(n) option remember; if n=1 then 1 else 2^(nops(convert(f(n-1), base, 2)))+1+f(n-1); fi; end; [seq(f(n), n=1..40)]; MATHEMATICA NestList[2^IntegerLength[#, 2]+1+#&, 1, 40] (* Harvey P. Dale, May 05 2020 *) CROSSREFS Cf. A010061. Sequence in context: A071400 A206806 A022913 * A218213 A075880 A042487 Adjacent sequences: A232225 A232226 A232227 * A232229 A232230 A232231 KEYWORD nonn AUTHOR N. J. A. Sloane, Nov 22 2013 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.

Last modified August 4 16:39 EDT 2024. Contains 374923 sequences. (Running on oeis4.)