This site is supported by donations to The OEIS Foundation.

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A017653 a(n) = 12*n + 11. 4
 11, 23, 35, 47, 59, 71, 83, 95, 107, 119, 131, 143, 155, 167, 179, 191, 203, 215, 227, 239, 251, 263, 275, 287, 299, 311, 323, 335, 347, 359, 371, 383, 395, 407, 419, 431, 443, 455, 467, 479, 491, 503, 515, 527, 539, 551, 563, 575, 587, 599, 611, 623, 635 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Or, with a different offset, 12*n - 1. In any case, numbers congruent to -1 mod 12. - Alonso del Arte, May 29 2011 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..3000 Tanya Khovanova, Recursive Sequences INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1000 Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA a(n) = 2*a(n-1) - a(n-2). - Vincenzo Librandi, Jun 08 2011 G.f.: (11+x)/(1-x)^2. - Colin Barker, Feb 19 2012 A089911(2*a(n)) = 11. - Reinhard Zumkeller, Jul 05 2013 MATHEMATICA Array[12*#+11&, 100, 0] (* Vladimir Joseph Stephan Orlovsky, Dec 14 2009 *) PROG (PARI) a(n)=12*n+11 (MAGMA) [12*n+11: n in [0..60]]; // Vincenzo Librandi, Jun 08 2011 (Haskell) a017653 = (+ 11) . (* 12)  -- Reinhard Zumkeller, Jul 05 2013 CROSSREFS Cf. A008594, A017533, A017545. Subsequence of A072065. Sequence in context: A041234 A041549 A136771 * A180316 A139793 A101859 Adjacent sequences:  A017650 A017651 A017652 * A017654 A017655 A017656 KEYWORD nonn,easy AUTHOR 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.