Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105801
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A105801
%S A105801 1,2,10,6,8,7,46,160,103,790,2680,1735,13246,44944,29095,222118,753640,
%T A105801 487879,3724558,12637312,8180935,62454742,211907032,137180887,
%U A105801 1047263758,3553333936,2300298847,17560898350,59583591592,38572244971
%N A105801 Fibonacci-Collatz sequence: a(1)=1, a(2)=2; for n>2, let fib=a(n-1)+a(n-2); 
               if fib is odd then a(n)=3*fib+1 else a(n)=fib/2.
%C A105801 Taking a(1)=1, a(2)=1 leads to the all ones sequence 1,1,1,1,1,1,... 
               (A000012); similarly a(1)=a(2)=b gives "all b's" sequence b,b,b,b,
               b,....
%t A105801 a[1]=1; a[2]=2; a[n_]:=a[n]=(fib=a[n-1]+a[n-2]; col=If[OddQ[fib],3*fib+1,
               fib/2]); Table[a[n],{n,30}]
%Y A105801 Cf. A000012, A000045, A006370.
%Y A105801 Sequence in context: A033468 A047816 A095845 this_sequence A086064 A076374 
               A142954
%Y A105801 Adjacent sequences: A105798 A105799 A105800 this_sequence A105802 A105803 
               A105804
%K A105801 nonn
%O A105801 1,2
%A A105801 Zak Seidov (zakseidov(AT)yahoo.com), Sep 12 2006

    
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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research