login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A253317 Indices in A253315 where records occur. 2
0, 1, 2, 3, 8, 9, 10, 11, 128, 129, 130, 131, 136, 137, 138, 139, 32768, 32769, 32770, 32771, 32776, 32777, 32778, 32779, 32896, 32897, 32898, 32899, 32904, 32905, 32906, 32907, 2147483648, 2147483649, 2147483650, 2147483651, 2147483656, 2147483657 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Michael De Vlieger, Table of n, a(n) for n = 1..4096

Lorenzo Sauras-Altuzarra, Some arithmetical problems that are obtained by analyzing proofs and infinite graphs, arXiv:2002.03075 [math.NT], 2020.

FORMULA

a(1) = 0 and a(n) = a(n-A053644(n-1)) + 2^(A053644(n-1)-1). - Lorenzo Sauras Altuzarra, Dec 18 2019

MAPLE

a := proc(n) local k, A:

A := [seq(0, i=1..n)]: A[1]:=0:

for k from 1 to n-1 do

   A[k+1] := A[k-2^ilog2(k)+1]+2^(2^ilog2(k)-1): od:

return A[n]: end proc: # Lorenzo Sauras Altuzarra, Dec 18 2019

MATHEMATICA

Nest[Append[#1, #1[[-#2]] + 2^(#2 - 1)] & @@ {#, 2^(IntegerLength[Length[#], 2] - 1)} &, {0, 1}, 36] (* Michael De Vlieger, May 08 2020 *)

PROG

(PARI) a(n)={if(n<=1, 0, my(t=1<<logint(n-1, 2)); a(n-t) + 2^(t-1))} \\ Andrew Howroyd, Dec 20 2019

CROSSREFS

Cf. A053644 (most significant bit).

Sequence in context: A037462 A309125 A037318 * A277971 A080288 A278560

Adjacent sequences:  A253314 A253315 A253316 * A253318 A253319 A253320

KEYWORD

nonn,base

AUTHOR

Philippe Beaudoin, Dec 30 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 13:15 EDT 2021. Contains 348170 sequences. (Running on oeis4.)