cp's OEIS Frontend

A017509 a(n) = 11*n + 10.

%I A017509 #54 Dec 03 2022 12:48:57
%S A017509 10,21,32,43,54,65,76,87,98,109,120,131,142,153,164,175,186,197,208,
%T A017509 219,230,241,252,263,274,285,296,307,318,329,340,351,362,373,384,395,
%U A017509 406,417,428,439,450,461,472,483,494,505,516,527,538,549,560,571,582
%N A017509 a(n) = 11*n + 10.
%C A017509 If k is any member of A045572, the sequence lists the numbers n such that (n^k+1)/11 is a nonnegative integer. See also A267541. - _Bruno Berselli_, Jan 16 2016
%H A017509 Vincenzo Librandi, <a href="/A017509/b017509.txt">Table of n, a(n) for n = 0..10000</a>
%H A017509 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H A017509 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=989">Encyclopedia of Combinatorial Structures 989</a>
%H A017509 Leo Tavares, <a href="/A017509/a017509.jpg">Illustration: Triangular Lines</a>
%H A017509 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A017509 From _G. C. Greubel_, Oct 29 2019: (Start)
%F A017509 G.f.: (10 + x)/(1-x)^2.
%F A017509 E.g.f.: (10 + 11*x)*exp(x).
%F A017509 a(n) = 2*a(n-1) - a(n-2). (End)
%F A017509 a(n) = A008591(n+1) + A005408(n). - _Leo Tavares_, Oct 25 2022
%p A017509 seq((11*n+10), n=0..60); # _G. C. Greubel_, Oct 29 2019
%t A017509 Range[10, 1000, 11] (* _Vladimir Joseph Stephan Orlovsky_, May 29 2011 *)
%t A017509 (11*Range[60] -1) (* _G. C. Greubel_, Oct 29 2019 *)
%o A017509 (Magma) [11*n+10: n in [0..60]]; // _Vincenzo Librandi_, Sep 18 2011
%o A017509 (PARI) a(n)=11*n+10 \\ _Charles R Greathouse IV_, Jul 10 2016
%o A017509 (Sage) [(11*n+10) for n in (0..60)] # _G. C. Greubel_, Oct 29 2019
%o A017509 (GAP) List([0..60], n-> (11*n+10)); # _G. C. Greubel_, Oct 29 2019
%o A017509 (Python)
%o A017509 def a(n): return 11*n + 10
%o A017509 print([a(n) for n in range(53)]) # _Michael S. Branicky_, Oct 21 2021
%Y A017509 Cf. A008593, A017401, A017413, A045572, A267541.
%Y A017509 Cf. A211013 (partial sums), A254322 (partial products).
%Y A017509 Powers of the form (11*n+10)^m: this sequence (m=1), A017510 (m=2), A017511 (m=3), A017512 (m=4), A017513 (m=5), A017514 (m=6), A017515 (m=7), A017516 (m=8), A017517 (m=9), A017518 (m=10), A017519 (m=11), A017520 (m=12).
%Y A017509 Cf. A008591, A005408.
%K A017509 nonn,easy
%O A017509 0,1
%A A017509 _N. J. A. Sloane_