Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078418
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078418 Numbers n such that h(n) = h(n-1) + h(n-2), where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.) +0
3
6, 22, 97, 108, 114, 495, 559, 2972, 3092, 3124, 3147, 3154, 3329, 3367, 3483, 3643, 3711, 3748, 3756, 3982, 4009, 4767, 17435, 17782, 17796, 17863, 17892, 17897, 18079, 18139, 18422, 18580, 18644, 18688, 18784, 18804, 18952, 19739, 19868 (list; graph; listen)
OFFSET

1,1

COMMENT

Recall that f(n) = n/2 if n is even; = 3n + 1 if n is odd.

EXAMPLE

n, f(n), f(f(n)), ...., 1 for n = 22, 21, 20, respectively, are: 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1; 21, 64, 32, 16, 8, 4, 2, 1; 20, 10, 5, 16, 8, 4, 2, 1. Hence h(22) = 16 = 8 + 8 = h(21) + h(20) and 22 belongs to the sequence.

MATHEMATICA

f[n_] := If[EvenQ[n], n/2, 3n+1]; h[n_] := Module[{a, i}, i=n; a=1; While[i>1, a++; i=f[i]]; a]; Select[Range[3, 19900], h[ # ]==h[ #-1]+h[ #-2]&]

CROSSREFS

Cf. A078419, A078420.

Sequence in context: A003699 A047124 A046365 this_sequence A100300 A027296 A151495

Adjacent sequences: A078415 A078416 A078417 this_sequence A078419 A078420 A078421

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 30 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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research