Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069196
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069196 a(1)=1, a(2)=3; for n>1, 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))/2 if (a(n+1)+a(n)==0 (mod 2)); and a(n+2)=a(n+1)+a(n) otherwise. +0
2
1, 3, 2, 5, 7, 4, 11, 5, 8, 13, 7, 10, 17, 9, 13, 11, 8, 19, 9, 14, 23, 37, 20, 19, 13, 16, 29, 15, 22, 37, 59, 32, 91, 41, 44, 85, 43, 64, 107, 57, 82, 139, 221, 120, 341, 461, 401, 431, 416, 847, 421, 634, 1055, 563, 809, 686, 1495, 727, 1111, 919, 1015, 967, 991 (list; graph; listen)
OFFSET

1,2

COMMENT

A Collatz-Fibonacci mixture. Does this sequence diverge to infinity?

CROSSREFS

Cf. A006369.

Sequence in context: A097284 A105353 A115966 this_sequence A108918 A118320 A082334

Adjacent sequences: A069193 A069194 A069195 this_sequence A069197 A069198 A069199

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 11 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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research