|
Search: id:A086398
|
|
|
| A086398 |
|
a(1)=1; a(n)=a(n-1)+2 if n is in the sequence; a(n)=a(n-1)+2 if n and (n-1) are not in the sequence; a(n)=a(n-1)+4 if n is not in the sequence but (n-1) is in the sequence. |
|
+0
1
|
|
| 1, 5, 7, 9, 11, 15, 17, 21, 23, 27, 29, 33, 35, 37, 39, 43, 45, 49, 51, 53, 55, 59, 61, 65, 67, 69, 71, 75, 77, 81, 83, 85, 87, 91, 93, 97, 99, 103, 105, 109, 111, 113, 115, 119, 121, 125, 127, 129, 131, 135, 137, 141, 143, 147, 149, 153, 155, 157, 159, 163, 165, 169
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n)=(1+sqrt(3))*n + O(1)
|
|
PROGRAM
|
(PARI) x=1; y=2; z=2; t=4; an[1]=x; for(n=2, 100, an[n]=if(setsearch(Set(vector(n-1, i, a(i))), n), a(n-1)+y, if(setsearch(Set(vector(n-1, i, a(i))), n-1), a(n-1)+t, a(n-1)+z)))
|
|
CROSSREFS
|
Cf. A086377.
Adjacent sequences: A086395 A086396 A086397 this_sequence A086399 A086400 A086401
Sequence in context: A064077 A026282 A080384 this_sequence A023380 A076190 A028885
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 13 2003
|
|
|
Search completed in 0.002 seconds
|
