A000546 -id:A000546 - cp's OEIS frontend

A000547 Number of steps to reach 1 in sequence A000546.

0, 9, 18, 37, 25, 120, 36, 47, 42, 59, 137, 143, 51, 48, 141, 41, 57, 73, 77, 76, 166, 80, 104, 93, 78, 96, 181, 102, 91, 102, 209, 201, 197, 194, 196, 129, 230, 115, 200, 97, 213, 206, 115, 216, 220, 214, 208, 246, 211, 233, 199, 208, 209, 224, 207, 228

Offset: 1

Peter L. Stone [ PetStone(AT)aol.com ]

nonn

T. D. Noe, Table of n, a(n) for n = 1..100

Cf. A000546.

A111329 Number of partitions of T where T = (3n + 1) if n is even and T=(3n + 1)/2 if n is odd.

Original entry on oeis.org

2, 15, 7, 101, 22, 490, 56, 1958, 135, 6842, 297, 21637, 627, 63261, 1255, 173525, 2436, 451276, 4565, 1121505, 8349, 2679689, 14883, 6185689, 26015, 13848650, 44583, 30167357, 75175, 64112359, 124754, 133230930, 204226, 271248950, 329931

Offset: 1

Parthasarathy Nambi, Nov 04 2005

nonn

			If n=1 then T = 2 and a(1) = 2.

Jeffrey C. Lagarias The 3x+1 problem: An annotated bibliography arXiv:math/0309224 [math.NT], 2003-2011.
Jeffrey C. Lagarias, "The Problem and Its Generalizations." Amer. Math. Monthly 92, 3-23, 1985.
Eric Weisstein's World of Mathematics, Collatz Problem

Cf. A000546, A070165, A006577.

f[n_] := If[EvenQ[n], PartitionsP[3n + 1], PartitionsP[(3n + 1)/2]]; Table[ f[n], {n, 35}] (* Robert G. Wilson v, Nov 07 2005 *)

a(n) = A000041(A165355(n-1)). [Reinhard Zumkeller, Nov 19 2009]

cp's OEIS Frontend

A000547 Number of steps to reach 1 in sequence A000546.

Views

Author

Keywords

Links

Crossrefs

A111329 Number of partitions of T where T = (3n + 1) if n is even and T=(3n + 1)/2 if n is odd.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula