[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A010675 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A010675 Period 2: repeat (0,4).
(history; published version)
#27 by Charles R Greathouse IV at Thu Sep 08 08:44:37 EDT 2022
PROG

(MAGMAMagma) &cat [[0, 4]^^50]; // Bruno Berselli, Dec 10 2015

Discussion
Thu Sep 08 08:44
OEIS Server: https://oeis.org/edit/global/2944
#26 by Charles R Greathouse IV at Sat Jul 23 02:43:32 EDT 2016
STATUS

editing

approved

#25 by Charles R Greathouse IV at Sat Jul 23 02:43:30 EDT 2016
PROG

(PARI) a(n)=n%2*4 \\ Charles R Greathouse IV, Jul 23 2016

STATUS

approved

editing

#24 by Bruno Berselli at Thu Dec 10 04:34:46 EST 2015
STATUS

editing

approved

#23 by Bruno Berselli at Thu Dec 10 04:34:43 EST 2015
FORMULA

a(n) = 2*(1-(-1)^n). ); a(n) = 4*(n mod 2) - Paolo P. Lava, Oct 20 2006

#22 by Bruno Berselli at Thu Dec 10 04:34:25 EST 2015
LINKS

<a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).

FORMULA

a(n) = 2*[*(1-(-1)^n]. ). a(n)=) = 4*(n mod 2) - Paolo P. Lava, Oct 20 2006

a(n) = 4*(1+floor((n+1)/2)-ceilceiling((n+1)/2)). - Wesley Ivan Hurt, May 21 2013

a(n) = 4 * *cos( Pi * (*(n+1)/2 )^2. - Wesley Ivan Hurt, May 21 2013

PROG

(MAGMA) &cat [[0, 4]^^50]; // Bruno Berselli, Dec 10 2015

KEYWORD

nonn,easy

STATUS

approved

editing

#21 by Charles R Greathouse IV at Sat Jun 13 00:48:26 EDT 2015
LINKS

<a href="/index/Rec">Index to sequencesentries withfor linear recurrences with constant coefficients</a>, signature (0,1).

Discussion
Sat Jun 13 00:48
OEIS Server: https://oeis.org/edit/global/2439
#20 by Charles R Greathouse IV at Fri Jun 12 15:32:22 EDT 2015
LINKS

<a href="/index/Rec#recLCC">Index to sequences with linear recurrences with constant coefficients</a>, signature (0,1).

Discussion
Fri Jun 12 15:32
OEIS Server: https://oeis.org/edit/global/2437
#19 by T. D. Noe at Tue May 21 14:51:25 EDT 2013
STATUS

editing

approved

#18 by T. D. Noe at Tue May 21 14:51:21 EDT 2013
FORMULA

a(n)=) = 2*[1-(-1)^n]. a(n)=4*(n mod 2) - Paolo P. Lava, Oct 20 2006

O.g.f.: -2/(1+x)-2/(x-1) . - ). - _R. J. Mathar, _, Feb 19 2008

a(n) = 4*(1+floor((n+1)/2)-ceil((n+1)/2)). - )). - _Wesley Ivan Hurt, _, May 21 2013

a(n) = 4 * cos( Pi * (n+1)/2 )^2. - . - _Wesley Ivan Hurt, _, May 21 2013

STATUS

proposed

editing

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 21:29 EDT 2024. Contains 375550 sequences. (Running on oeis4.)