This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A017605 12n+7. 6

%I

%S 7,19,31,43,55,67,79,91,103,115,127,139,151,163,175,187,199,211,223,

%T 235,247,259,271,283,295,307,319,331,343,355,367,379,391,403,415,427,

%U 439,451,463,475,487,499,511,523,535,547,559,571,583,595,607,619,631

%N 12n+7.

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

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

%F 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

%F a(n) = (n+1)*A016921(n+1) - n*A016921(n). - _Bruno Berselli_, Jan 18 2013

%t 12*Range[0,200] + 7 (* _Vladimir Joseph Stephan Orlovsky_, Feb 19 2011*)

%o (Sage) [i+7 for i in range(525) if gcd(i,12) == 12] # _Zerinvary Lajos_, May 21 2009

%o (PARI) a(n)=12*n+7 \\ _Charles R Greathouse IV_, Jul 10 2016

%Y Cf. A008594, A016921, A017533, A017545, A068229.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_.

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.