login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133622 a(n)=1 if n is odd, a(n)=n/2+1 if n is even. 5
1, 2, 1, 3, 1, 4, 1, 5, 1, 6, 1, 7, 1, 8, 1, 9, 1, 10, 1, 11, 1, 12, 1, 13, 1, 14, 1, 15, 1, 16, 1, 17, 1, 18, 1, 19, 1, 20, 1, 21, 1, 22, 1, 23, 1, 24, 1, 25, 1, 26, 1, 27, 1, 28, 1, 29, 1, 30, 1, 31, 1, 32, 1, 33, 1, 34, 1, 35, 1, 36, 1, 37, 1, 38, 1, 39, 1, 40, 1, 41, 1, 42, 1, 43, 1, 44, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

a(n)=1+(binomial(n+1,2)mod n)=1+(binomial(n+1,n-1)mod n).

a(n)=binomial(n+2,2) mod n = binomial(n+2,n) mod n for n>2.

a(n)=1+(1+(-1)^n)*n/4.

a(n)=1+(A000217(n) mod n).

a(n)=a(n-2)+1, if n is even, a(n)=a(n-2) if n is odd.

a(n)=a(n-2)+1-(n mod 2)=a(n-2)+(1+(-1)^n)/2 for n>2.

a(n)=(a(n-3)+a(n-2))/a(n-1) for n>3.

G.f.: g(x)=x(1+2x-x^2-x^3)/(1-x^2)^2.

CROSSREFS

Cf. A133620, A133621, A133623, A133624, A133625, A133630, A038509, A133634-A133636.

Cf. A133872, A133882, A133880, A133890, A133900, A133910.

Cf. Other related sequences: A000217, A007879, A057979.

Sequence in context: A057979 A152271 * A158416 A162520 A090331 A165818

Adjacent sequences:  A133619 A133620 A133621 * A133623 A133624 A133625

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Sep 30 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 19:48 EST 2012. Contains 205955 sequences.