|
Search: id:A069013
|
|
|
| A069013 |
|
a(1)=a(2)=a(3)=1 a(n+3)=floor(a(n)+(a(n+1)/a(n+2))). |
|
+0
1
|
|
| 1, 1, 1, 2, 1, 3, 2, 2, 4, 2, 4, 4, 3, 5, 4, 4, 6, 4, 5, 6, 4, 6, 6, 5, 7, 6, 6, 8, 6, 7, 8, 6, 8, 8, 7, 9, 8, 8, 10, 8, 9, 10, 8, 10, 10, 9, 11, 10, 10, 12, 10, 11, 12, 10, 12, 12, 11, 13, 12, 12, 14, 12, 13, 14, 12, 14, 14, 13, 15, 14, 14, 16, 14, 15, 16, 14, 16, 16, 15, 17, 16, 16, 18
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
To illustrate the formula : if k>=2, (2k, 2k, 2k-1, 2k+1, 2k, 2k, 2k+2, 2k, 2k+1, 2k+2, 2k) are 11 following terms in the sequence. Ex : if k=5 (10,10,9,11,10,10,12,10,11,12,10) form the terms from a(44) to a(54).
|
|
FORMULA
|
for k>=1 a(11k)=2k+2 a(11k+1)=2k+2 a(11k+2)=2k+1 a(11k+3)=2k+3 a(11k+4)=2k+2 a(11k+5)=2k+2 a(11k+6)=2k+4 a(11k+7)=2k+2 a(11k+8)=2k+3 a(11k+9)=2k+4 a(11k+10)=2k+2
|
|
CROSSREFS
|
Sequence in context: A029270 A090350 A086415 this_sequence A029281 A126792 A097367
Adjacent sequences: A069010 A069011 A069012 this_sequence A069014 A069015 A069016
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 02 2002
|
|
|
Search completed in 0.002 seconds
|
