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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A017641 a(n) = 12n + 10. 14
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.
FORMULA
A030132(a(n)) = 9. - Reinhard Zumkeller, Jul 04 2007
G.f.: 2*(5 + x)/(1 - x)^2. - Stefano Spezia, May 09 2021
Sum_{n>=0} (-1)^n/a(n) = Pi/12 - sqrt(3)*log(2 + sqrt(3))/12. - Amiram Eldar, Dec 12 2021
MATHEMATICA
Range[10, 1000, 12] (* Vladimir Joseph Stephan Orlovsky, May 29 2011 *)
PROG
(PARI) a(n)=12*n+10 \\ Charles R Greathouse IV, Jul 10 2016
CROSSREFS
Sequence in context: A214153 A179887 A339003 * A232540 A217573 A276626
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)