Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078421
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078421 Least positive integer solution k to h(k) = n h(k-1), where h(n) is the length of n, f(n), f(f(n)), ...., 1 in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.) +0
1
13, 2, 105, 3, 9, 1742, 1961, 1705, 161, 11945 (list; graph; listen)
OFFSET

1,1

COMMENT

1. Recall that f(n) = n/2 if n is even; = 3n + 1 if n is odd. 2. Problem: Is a(n) defined for all n, that is, does a positive integer solution k to h(k) = n h(k-1) always exist? 3. If a(11) is defined, then a(11) > 3 x 10^5.

a(11)>2^22 - Michel ten Voorde (seqfan(AT)tenvoorde.org) Jun 20 2003

EXAMPLE

n, f(n), f(f(n)), ...., 1 for n = 105, 104, respectively, are: 105, 316, 158, 79, 238, 119, 358, 179, 538, 269, 808, 404, 202, 101, 304, 152, 76, 38, 19, 58, 29, 88, 44, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1; 104, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, of lengths 39 = 3 x 13 and 13, respectively. Hence k = 105 is a solution to h(k) = 3 h(k-1) and it is also the smallest solution. This implies a(3) = 105.

MATHEMATICA

h[n_] := Module[{a, i}, i = n; a = 1; While[i > 1, a = a + 1; i = f[i]]; a]; a = {}; For[k = 1, k <= 30, k++, j = 2; While[ h[j] != k h[j - 1], j = j + 1]; a = Append[a, j]]; a

CROSSREFS

Sequence in context: A031066 A154355 A154354 this_sequence A098222 A114457 A010220

Adjacent sequences: A078418 A078419 A078420 this_sequence A078422 A078423 A078424

KEYWORD

more,nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Dec 29 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research