Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069203
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A069203
%S A069203 0,3,1,4,5,3,8,11,19,10,29,13,14,9,23,32,55,29,28,19,47,22,23,15,38,53,
%T A069203 91,48,139,187,326,171,497,668,1165,611,592,401,331,244,575,273,848,
%U A069203 1121,1969,1030,2999,1343,4342,1895,2079,3974,6053,10027,5360,5129
%N A069203 a(1)=0 a(2)=3 a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=a(n+1)+a(n) 
               otherwise.
%C A069203 A Collatz-Fibonacci mixture. If a(1)=0 and a(2)=m not congruent to 3, 
               a(n) is cyclic (m,m,2m). Does this sequence diverge to infinity if 
               a(1)=0 and a(2)=m == 0 (mod 3)?
%Y A069203 Sequence in context: A029637 A097207 A118469 this_sequence A046070 A068399 
               A105177
%Y A069203 Adjacent sequences: A069200 A069201 A069202 this_sequence A069204 A069205 
               A069206
%K A069203 easy,nonn
%O A069203 1,2
%A A069203 Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 11 2002

    
page 1

Search completed in 0.001 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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research