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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A017533 a(n) = 12n + 1. 29
1, 13, 25, 37, 49, 61, 73, 85, 97, 109, 121, 133, 145, 157, 169, 181, 193, 205, 217, 229, 241, 253, 265, 277, 289, 301, 313, 325, 337, 349, 361, 373, 385, 397, 409, 421, 433, 445, 457, 469, 481, 493, 505, 517, 529, 541, 553, 565, 577, 589, 601, 613, 625, 637 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..53.

Tanya Khovanova, Recursive Sequences

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

FORMULA

a(n) = 24*n - a(n-1) - 10, (with a(0)=1). - Vincenzo Librandi, Dec 24 2010

G.f.: (1 + 11x)/(x - 1)^2. - Indranil Ghosh, Apr 05 2017

MATHEMATICA

Array[12*#+1&, 100, 0] (* Vladimir Joseph Stephan Orlovsky, Dec 14 2009 *)

CoefficientList[Series[(1 + 11 x)/(x - 1)^2, {x, 0, 53}], x] (* Michael De Vlieger, Apr 05 2017 *)

PROG

(PARI) a(n)=12*n+1 \\ Charles R Greathouse IV, Jul 10 2016

(Python) def a(n): return 12*n + 1 # Indranil Ghosh, Apr 05 2017

(C)

#include<stdio.h>

int main(){

int n;

for(n=0; n<=100; n++)

printf("%d, ", 12*n + 1);

return 0;

} /* Indranil Ghosh, Apr 05 2017 */

CROSSREFS

Cf. A161700, A005408, A016813, A016921, A017281, A158057, A161705, A161709, A161714, A128470, A016945.

Sequence in context: A280925 A161603 A075033 * A264732 A195558 A026058

Adjacent sequences:  A017530 A017531 A017532 * A017534 A017535 A017536

KEYWORD

nonn,easy

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified April 25 23:17 EDT 2017. Contains 285426 sequences.