[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A176592 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
List of pairs n,11*n
(history; published version)
#13 by Harvey P. Dale at Tue Jul 27 10:20:54 EDT 2021
STATUS

editing

approved

#12 by Harvey P. Dale at Tue Jul 27 10:20:47 EDT 2021
FORMULA

G.f.: (1+11 x)/(-1+x^2)^2 (* Harvey P. Dale, Jul 27 2021 *)

STATUS

approved

editing

#11 by Harvey P. Dale at Wed Nov 25 07:42:47 EST 2015
STATUS

editing

approved

#10 by Harvey P. Dale at Wed Nov 25 07:42:43 EST 2015
MATHEMATICA

Flatten[Table[{n, 11n}, {n, 40}]] (* or *) LinearRecurrence[{0, 2, 0, -1}, {1, 11, 2, 22}, 80] (* Harvey P. Dale, Nov 25 2015 *)

STATUS

approved

editing

#9 by Ray Chandler at Tue Jul 28 10:20:48 EDT 2015
STATUS

editing

approved

#8 by Ray Chandler at Tue Jul 28 10:20:45 EDT 2015
LINKS

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

STATUS

approved

editing

#7 by R. J. Mathar at Mon Sep 02 13:47:19 EDT 2013
STATUS

proposed

approved

#6 by Jon E. Schoenfield at Mon Sep 02 13:44:56 EDT 2013
STATUS

editing

proposed

#5 by Jon E. Schoenfield at Mon Sep 02 13:44:55 EDT 2013
FORMULA

a(n)=(1/4)*(12*n+10*n*(-1)^n+1+(-1)^(n-1)) for n > 1, with a(1) = 1 (corrected by _Jon E. Schoenfield, _, Jun 19 2010)

STATUS

approved

editing

#4 by N. J. A. Sloane at Wed May 01 21:09:57 EDT 2013
EXTENSIONS

Partially edited by _N. J. A. Sloane, _, Jun 23 2010

Discussion
Wed May 01
21:09
OEIS Server: https://oeis.org/edit/global/1899