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.

A239124 a(n) = 64*n - 11 for n >= 1. Third column of triangle A238476.

Original entry on oeis.org

53, 117, 181, 245, 309, 373, 437, 501, 565, 629, 693, 757, 821, 885, 949, 1013, 1077, 1141, 1205, 1269, 1333, 1397, 1461, 1525, 1589, 1653, 1717, 1781, 1845, 1909, 1973, 2037, 2101, 2165, 2229, 2293, 2357, 2421, 2485, 2549, 2613, 2677, 2741, 2805, 2869, 2933, 2997
Offset: 1

Views

Author

Wolfdieter Lang, Mar 10 2014

Keywords

Comments

This sequence gives all start numbers a(n) (sorted increasingly) of Collatz sequences of length 7 following the pattern ud^5 with u (for `up'), mapping an odd number m to 3*m+1, and d (for `down'), mapping an even number m to m/2, requiring that the sequence ends in an odd number. The last entry of this Collatz sequence is 6*n - 1.
This appears in Example 2.1. for x = 5 in the M. Trümper paper given as a link below.

Examples

			a(1) = 53 because the Collatz sequence of length 7 following the pattern uddddd, ending in an odd number is [53, 160, 80, 40, 20, 10, 5]. The end number is 6*1 - 1 = 5.
		

Crossrefs

Cf. A004767 (first column), A082285 (second column), A238476.

Programs

Formula

O.g.f.: x*(53+11*x)/(1-x)^2.
From Elmo R. Oliveira, Apr 04 2025: (Start)
E.g.f.: 11 + exp(x)*(64*x - 11).
a(n) = 2*a(n-1) - a(n-2) for n > 2. (End)