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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A017605 a(n) = 12*n + 7. 12
 7, 19, 31, 43, 55, 67, 79, 91, 103, 115, 127, 139, 151, 163, 175, 187, 199, 211, 223, 235, 247, 259, 271, 283, 295, 307, 319, 331, 343, 355, 367, 379, 391, 403, 415, 427, 439, 451, 463, 475, 487, 499, 511, 523, 535, 547, 559, 571, 583, 595, 607, 619, 631 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Table of n, a(n) for n=0..52. Tanya Khovanova, Recursive Sequences Leo Tavares, Illustration: Hexagonal Wheels Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA a(n) = 2*(12*n+1) - a(n-1) = 2*a(n-1) - a(n-2) with a(0) = 7, a(1) = 19. - Vincenzo Librandi, Nov 19 2010 a(n) = (n+1)*A016921(n+1) - n*A016921(n). - Bruno Berselli, Jan 18 2013 a(n) = A003215(n+1) - 6*A000217(n-1). - Leo Tavares, Jul 25 2021 From Elmo R. Oliveira, Apr 02 2024: (Start) G.f.: (7+5*x)/(1-x)^2. E.g.f.: exp(x)*(7 + 12*x). a(n) = A049453(n+1) - A049453(n) = A142241(n)/2. (End) MATHEMATICA 12*Range[0, 200] + 7 (* Vladimir Joseph Stephan Orlovsky, Feb 19 2011 *) PROG (Sage) [i+7 for i in range(525) if gcd(i, 12) == 12] # Zerinvary Lajos, May 21 2009 (PARI) a(n)=12*n+7 \\ Charles R Greathouse IV, Jul 10 2016 CROSSREFS Cf. A008594, A016921, A017533, A017545, A068229. Cf. A000217, A003215, A049453, A142241. Sequence in context: A216133 A079740 A030549 * A126194 A068229 A323594 Adjacent sequences: A017602 A017603 A017604 * A017606 A017607 A017608 KEYWORD nonn,easy,changed AUTHOR N. J. A. Sloane STATUS approved

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.

Last modified April 16 23:10 EDT 2024. Contains 371755 sequences. (Running on oeis4.)