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!)
 A017641 a(n) = 12n + 10. 7
 10, 22, 34, 46, 58, 70, 82, 94, 106, 118, 130, 142, 154, 166, 178, 190, 202, 214, 226, 238, 250, 262, 274, 286, 298, 310, 322, 334, 346, 358, 370, 382, 394, 406, 418, 430, 442, 454, 466, 478, 490, 502, 514, 526, 538, 550, 562, 574, 586, 598, 610, 622, 634 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Exponents e such that x^e + x^2 - 1 is reducible. If Y is a 4-subset of an (2n+1)-set X then, for n>=3, a(n-2) is the number of 3-subsets of X having at least two elements in common with Y. - Milan Janjic, Dec 16 2007 LINKS Tanya Khovanova, Recursive Sequences Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA A030132(a(n)) = 9. - Reinhard Zumkeller, Jul 04 2007 a(n) = 24*n - a(n-1) + 8, (with a(0)=10). - Vincenzo Librandi, Dec 24 2010 MATHEMATICA Range[10, 1000, 12] (* Vladimir Joseph Stephan Orlovsky, May 29 2011 *) PROG (Sage) [i+10 for i in range(527) if gcd(i, 12) == 12] # Zerinvary Lajos, May 21 2009 (PARI) a(n)=12*n+10 \\ Charles R Greathouse IV, Jul 10 2016 CROSSREFS Cf. A008594, A017533, A017545, A017593. Sequence in context: A053361 A214153 A179887 * A232540 A217573 A276626 Adjacent sequences:  A017638 A017639 A017640 * A017642 A017643 A017644 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.

Last modified May 28 19:46 EDT 2017. Contains 287241 sequences.