|
| |
|
|
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.
|
|
1
| |
|
|
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, 91, 48, 139, 187, 326, 171, 497, 668, 1165, 611, 592, 401, 331, 244, 575, 273, 848, 1121, 1969, 1030, 2999, 1343, 4342, 1895, 2079, 3974, 6053, 10027, 5360, 5129
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| 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)?
|
|
|
LINKS
| Harvey P. Dale, Table of n, a(n) for n = 1..1000
|
|
|
MATHEMATICA
| Transpose[NestList[{Last[#], If[Divisible[Total[#], 3], Total[#]/3, Total[ #]]}&, {0, 3}, 60]][[1]] (* From Harvey P. Dale, Dec 08 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A097207 A118469 A198553 * A046070 A068399 A183904
Adjacent sequences: A069200 A069201 A069202 * A069204 A069205 A069206
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 11 2002
|
| |
|
|
