|
| |
|
|
A128999
|
|
Start with an integer (in this case 1). First, add 5 or 6 if the integer is odd or even, respectively. Then divide by 2. Notice any a(1)<=5 converges to 5 and any a(1)>=6 converges to 6.
|
|
0
| |
|
|
1, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Tanya Khovanova, Arithmetic Progression.
|
|
|
FORMULA
| a(n)=[a(n-1) + b]/d, if a(n) even =[a(n-1) + c]/d, if a(n) odd (starting a(1)=1 with b=5, c=6, d=2)
a(n)=5 for n>=4. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 31 2007
a(n)=5-4*[C(2*(n-1),(n-1)) mod 2]-2*[C(n^2,n+2) mod 2]-[C((n-1)^2,n+1) mod 2], with n>=1 - Paolo P. Lava (paoloplava(AT)gmail.com), Feb 01 2008
|
|
|
CROSSREFS
| Cf. A085600.
Sequence in context: A178698 A161386 A085600 * A122816 A064007 A068568
Adjacent sequences: A128996 A128997 A128998 * A129000 A129001 A129002
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Adam F. Schwartz (adam_s(AT)mit.edu), May 01 2007
|
|
|
EXTENSIONS
| More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 31 2007
|
| |
|
|
