|
Search: id:A069211
|
|
|
| A069211 |
|
Let u(n,k) be the recursion: u(n,1)=1 u(n,2)=n u(n,k+3)= (1/2) *(u(n,k+1)+u(n,k)) if u(n,k+1)+u(n,k) is even u(n,k+3)=abs(u(n,k+1)-u(n,k)) otherwise. Sequence gives integer values a(n) such that u(n,k)=1 for any k>=a(n). |
|
+0
1
|
|
| 1, 3, 4, 6, 8, 7, 7, 9, 13, 11, 8, 10, 16, 10, 10, 12, 14, 16, 12, 14, 14, 11, 11, 13, 15, 19, 11, 13, 17, 13, 13, 15, 21, 17, 17, 19, 18, 15, 15, 17, 21, 17, 12, 14, 19, 14, 14, 16, 24, 18, 20, 22, 22, 14, 14, 16, 19, 20, 14, 16, 25, 16, 16, 18, 20, 24, 18, 20, 28, 20, 20, 22
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
It seems that sum(i=1,n,a(i)) ~ C*n*ln(n) asymptotically with C=0.2...
|
|
FORMULA
|
a(2n) = a(n) + 2 + [n>1]. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 08 2003
|
|
EXAMPLE
|
Let n=7, for k=1,2,3,4,5,6,7,8 u(7,k)=1,7,4,3,1,2,1,1 hence a(7)=7 since for all k>=7 u(7,k)=1.
|
|
CROSSREFS
|
Sequence in context: A058639 A139450 A072152 this_sequence A099356 A121543 A080702
Adjacent sequences: A069208 A069209 A069210 this_sequence A069212 A069213 A069214
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 11 2002
|
|
|
Search completed in 0.002 seconds
|
