login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..105.

Tanya Khovanova, Arithmetic Progression.

Index entries for linear recurrences with constant coefficients, signature (1).

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, 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, Feb 01 2008

CROSSREFS

Cf. A085600.

Sequence in context: A319460 A161386 A085600 * A220854 A122816 A064007

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, Oct 31 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 9 04:51 EDT 2020. Contains 335538 sequences. (Running on oeis4.)