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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215495 a(4*n) = a(4*n+2) = a(2*n+1) = 2*n + 1. 4
1, 1, 1, 3, 3, 5, 3, 7, 5, 9, 5, 11, 7, 13, 7, 15, 9, 17, 9, 19, 11, 21, 11, 23, 13, 25, 13, 27, 15, 29, 15, 31, 17, 33, 17, 35, 19, 37, 19, 39, 21, 41, 21, 43, 23, 45, 23, 47, 25, 49, 25, 51, 27, 53, 27, 55, 29, 57, 29, 59, 31, 61, 31, 63, 33, 65, 33, 67, 35, 69, 35, 71, 37, 73, 37, 75, 39, 77, 39, 79, 41, 81, 41, 83, 43, 85, 43 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

A214282(n) and -A214283(n) are companions. Separately or together, they have many links with the Catalan's numbers A000108(n). Examples:

A214282(n+1) - 2*A214282(n) = -1, -1,  1,  0, -2, -5,  5,   0, -14, -42,  42,    0, -132, ....

2*A214283(n) - A214283(n+1) =  1,  0, -1, -2,  2,  0, -5, -14,  14,   0, -42, -132, 132, ....

A214282(n) + A214283(n) = 1, 0, -1, 0, 2, 0, -5, 0, 14, 0, -42,... (A126120).

The companion to a(n) is b(n) = -A214283(n)/(1,1,1,1,2,2,5,5,...) = 0, 1, 2, 3, 2, 5, 4, 7, 4, 9, 6, ....

a(n) - b(n) = A056594(n).

Discovered as a(n) = A214282(n+1)/A000108([n/2]). See abs(A129996(n-2)).

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

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

FORMULA

a(n+3) = (A185048(n+3)=2,2,4,2,... ) + 1.

a(n+2) - a(n) = 0, 2, 2, 2. (Period 4).

a(n) = 2*a(n-4) - a(n-8).

a(2*n) = A109613(n).

a(n+1) - a(n) = 2* (-1)^n * A059169(n).

G.f. : ( 1+x+2*x^3+x^4+x^5 ) / ( (x^2+1)*(x-1)^2*(1+x)^2 ). - Jean-François Alcover, Aug 14 2012

MATHEMATICA

a[n_?EvenQ] := n/2 + Boole[Mod[n, 4] == 0]; a[n_?OddQ] := n; Table[a[n], {n, 0, 86}] (* Jean-François Alcover, Aug 14 2012 *)

LinearRecurrence[{0, 1, 0, 1, 0, -1}, {1, 1, 1, 3, 3, 5}, 50] (* G. C. Greubel, Apr 23 2018 *)

PROG

(PARI) x='x+O('x^30); Vec(( 1+x+2*x^3+x^4+x^5 )/( (x^2+1)*(x-1)^2*(1+x)^2 )) \\ G. C. Greubel, Apr 23 2018

(MAGMA) I:=[1, 1, 1, 3, 3, 5]; [n le 6 select I[n] else Self(n-2) +Self(n-4) -Self(n-6): n in [1..30]]; // G. C. Greubel, Apr 23 2018

CROSSREFS

Cf. A130823, A090192.

Sequence in context: A029622 A015126 A219793 * A299149 A096866 A015909

Adjacent sequences:  A215492 A215493 A215494 * A215496 A215497 A215498

KEYWORD

nonn,easy

AUTHOR

Paul Curtz, Aug 13 2012

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 February 21 18:45 EST 2019. Contains 320376 sequences. (Running on oeis4.)