The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A078438 a(n) = least positive integer solution k to h(k) = h(k-1)+h(k-2)+...+h(k-n), 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
 13, 6, 235, 342, 41, 5735, 90746642 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 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(n) = h(k-1)+h(k-2)+...+h(k-n) always exist? LINKS EXAMPLE k = 235 is the least k satisfying h(k) = h(k-1)+h(k-2)+h(k-3), so a(3) = 235. CROSSREFS Sequence in context: A160247 A300886 A301496 * A225954 A133723 A324279 Adjacent sequences:  A078435 A078436 A078437 * A078439 A078440 A078441 KEYWORD more,nonn AUTHOR Joseph L. Pe, Dec 31 2002 EXTENSIONS a(7) from Donovan Johnson, Nov 14 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 03:20 EST 2020. Contains 338632 sequences. (Running on oeis4.)