%I A017641
%S A017641 10,22,34,46,58,70,82,94,106,118,130,142,154,166,178,190,
%T A017641 202,214,226,238,250,262,274,286,298,310,322,334,346,358,
%U A017641 370,382,394,406,418,430,442,454,466,478,490,502,514,526
%N A017641 (12n+10).
%C A017641 Exponents e such that x^e+x^2-1 is reducible.
%C A017641 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 R. Janjic (agnus(AT)blic.net), Dec 16 2007
%H A017641 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A017641 A030132(a(n)) = 9. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Jul 04 2007
%o A017641 (Other) sage: [i+10 for i in range(527) if gcd(i,12) == 12] # [From Zerinvary 
               Lajos (zerinvarylajos(AT)yahoo.com), May 21 2009]
%Y A017641 Cf. A017593.
%Y A017641 Sequence in context: A007366 A109958 A053361 this_sequence A028569 A014367 
               A063710
%Y A017641 Adjacent sequences: A017638 A017639 A017640 this_sequence A017642 A017643 
               A017644
%K A017641 nonn,easy
%O A017641 0,1
%A A017641 N. J. A. Sloane (njas(AT)research.att.com).