|
Search: id:A111202
|
|
|
| A111202 |
|
a(1)=2 then a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-2)+1 otherwise. |
|
+0
1
|
|
| 2, 5, 3, 6, 9, 12, 10, 13, 16, 19, 17, 20, 23, 21, 24, 27, 30, 28, 31, 34, 37, 35, 38, 41, 39, 42, 45, 48, 46, 49, 52, 50, 53, 56, 59, 57, 60, 63, 66, 64, 67, 70, 68, 71, 74, 77, 75, 78, 81, 84, 82, 85, 88, 86, 89, 92, 95, 93, 96, 99, 97, 100, 103, 106, 104, 107, 110, 113, 111
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n)=phi*n+O(1) where phi=(1+sqrt(5))/2
|
|
PROGRAM
|
(PARI) an=vector(100); a(n)=if(n<0, 0, an[n]); an[1]=2; for(n=2, 100, an[n]=if(setsearch(Set(vector(n-1, i, a(i))), n), a(n-1)+3, a(n-2)+1))
|
|
CROSSREFS
|
Sequence in context: A037852 A160516 A024871 this_sequence A163362 A112486 A141410
Adjacent sequences: A111199 A111200 A111201 this_sequence A111203 A111204 A111205
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 24 2005
|
|
|
Search completed in 0.002 seconds
|
