A213710 -id:A213710 - cp's OEIS frontend

A234019 Maximum values occurring in each row of A233270: a(n) = A233270(A233268(n) - A234020(n)).

Original entry on oeis.org

0, -1, 0, 1, 2, 4, 6, 19, 38, 67, 127, 234, 419, 745, 1378, 2678, 5311, 10470, 20333

Offset: 1

Antti Karttunen, Dec 29 2013

sign

Please see the graph of A233270.

Cf. A233268, A233270, A234018, A234020.

a(n) = A233270(A233268(n) - A234020(n)).

A261232 a(n) = number of steps to reach 0 when starting from k = 3^n and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k).

Original entry on oeis.org

1, 2, 4, 9, 21, 50, 124, 320, 850, 2295, 6251, 17113, 47014, 129606, 358839, 998806, 2796094, 7869801, 22251148, 63141640, 179701240, 512744600, 1466635090, 4205423896, 12087339724, 34816804311, 100469592522, 290336059741, 839932833291, 2432050970421, 7047731703138, 20440131344751, 59334695322384, 172409162871824, 501489513690424

Offset: 0

Antti Karttunen, Aug 13 2015

nonn

One more than A261233.
Cf. A000244, A261231.
Cf. also A213710.

a(0) = 1; for n >= 1, a(n) = A261234(n-1) + a(n-1).
a(n) = A261231(3^n).
a(n) = 1 + A261233(n).

Terms from a(24) onward added from the output of Hiroaki Yamanouchi's program by Antti Karttunen, Aug 16 2015

A322983 Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = n.

Original entry on oeis.org

0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 3, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 2, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 0, 2, 0, 1, 0, 3, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0

Offset: 1

Antti Karttunen, Jan 05 2019

Terms 0 .. 10 occur for the first time at n = 1, 2, 6, 12, 126, 192, 486, 492, 498, 504, 65458.

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences related to binary expansion of n

Cf. A000120, A011371, A071542, A179016, A213710, A322984 (bisection).

Cf. also A322996.

A322983(n) = if((n%2),0,1+A322983(n - hammingweight(n)));

If n is odd, a(n) = 0, if n is even, a(n) = 1 + a(A011371(n)).

cp's OEIS Frontend

A234019 Maximum values occurring in each row of A233270: a(n) = A233270(A233268(n) - A234020(n)).

Views

Author

Keywords

Comments

Crossrefs

Formula

A261232 a(n) = number of steps to reach 0 when starting from k = 3^n and repeatedly applying the map that replaces k with k - (sum of digits in base-3 representation of k).

Views

Author

Keywords

Crossrefs

Formula

Extensions

A322983 Number of iterations of A011371(x) = x - A000120(x) needed to reach an odd number, when starting from x = n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula