cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A222752 Irregular array of odd numbers T(n,k) such that the difference between the number of halving and tripling steps in the Collatz (3x+1) iteration is n.

Original entry on oeis.org

1, 3, 5, 13, 21, 7, 11, 17, 9, 15, 23, 35, 53, 85, 19, 29, 45, 69, 75, 113, 25, 37, 61, 93, 141, 151, 213, 227, 341, 33, 49, 51, 77, 81, 117, 181, 201, 277, 301, 453, 43, 65, 67, 99, 101, 149, 163, 241, 245, 267, 369, 373, 401, 403, 565, 605, 853, 909, 1365
Offset: 0

Views

Author

T. D. Noe, Mar 04 2013

Keywords

Comments

These are the odd numbers in A222599. Sequence A222753 gives the length of the rows.

Examples

			The rows are
{1},
{},
{},
{3, 5},
{},
{13, 21},
{7, 11, 17},
{9, 15, 23, 35, 53, 85},
{19, 29, 45, 69, 75, 113},
{25, 37, 61, 93, 141, 151, 213, 227, 341},
{33, 49, 51, 77, 81, 117, 181, 201, 277, 301, 453}
		

Crossrefs

Programs

  • Mathematica
    Collatz[n_] := NestWhileList[If[EvenQ[#], #/2, 3 # + 1] &, n, # > 1 &]; nn = 15; t = Table[{}, {nn}]; Do[c = Collatz[n]; e = Select[c, EvenQ]; diff = 2*Length[e] - Length[c]; If[diff < nn - 1, AppendTo[t[[diff + 2]], n]], {n, 1, 2^(nn - 1), 2}]; t

A213678 Number of terms k such that difference between halving and tripling steps in Collatz (3x+1) trajectory of k is n.

Original entry on oeis.org

1, 1, 1, 3, 3, 5, 8, 14, 20, 29, 40, 59, 87, 130, 196, 294, 439, 658, 985, 1459, 2203, 3328, 5001, 7482, 11205, 16805, 25220, 37850, 56713, 85108, 127728, 191635
Offset: 0

Views

Author

Jayanta Basu, Mar 04 2013

Keywords

Examples

			a(5) = 5 since there are only five numbers 12, 13, 20, 21, 32 such that difference between number of halving and tripling steps is 5.
		

Crossrefs

Cf. A220071, A222599 (lists of numbers).

Programs

  • Mathematica
    Collatz[n_] := NestWhileList[If[EvenQ[#], #/2, 3 # + 1] &, n, # > 1 &]; nn = 15; t = Table[0, {nn}]; Do[c = Collatz[n]; e = Select[c, EvenQ]; diff = 2*Length[e] - Length[c]; If[diff < nn - 1, t[[diff + 2]]++], {n, 2^(nn - 1)}]; t (* T. D. Noe, Mar 04 2013 *)

Extensions

Corrected and extended by T. D. Noe, Mar 06 2013

A222600 Least number k such that the difference between the number of halving and tripling steps in the Collatz (3x+1) iteration is n.

Original entry on oeis.org

1, 2, 4, 3, 6, 12, 7, 9, 18, 25, 33, 43, 39, 78, 105, 135, 123, 169, 159, 295, 283, 111, 222, 297, 175, 103, 91, 121, 31, 27, 54, 73, 97, 129, 171, 231, 313, 411, 543, 327, 649, 859, 763, 1017, 1351, 1215, 703, 937, 871, 1161, 2223, 3097, 2631, 3567, 3175, 4233
Offset: 0

Views

Author

T. D. Noe, Mar 04 2013

Keywords

Comments

This is the first number in row n of A222599.

Crossrefs

Programs

  • Mathematica
    Collatz[n_] := NestWhileList[If[EvenQ[#], #/2, 3 # + 1] &, n, # > 1 &]; nn = 50; t = Table[0, {nn}]; n = 0; While[Min[t] == 0, n++; c = Collatz[n]; e = Select[c, EvenQ]; diff = 2*Length[e] - Length[c]; If[diff < nn - 1 && t[[diff + 2]] == 0, t[[diff + 2]] = n]]; t
Showing 1-3 of 3 results.