|
%I #38 Sep 08 2022 08:44:42
%S 4,15,26,37,48,59,70,81,92,103,114,125,136,147,158,169,180,191,202,
%T 213,224,235,246,257,268,279,290,301,312,323,334,345,356,367,378,389,
%U 400,411,422,433,444,455,466,477,488,499,510,521,532,543,554,565,576,587
%N a(n) = 11*n + 4.
%C These numbers do not occur in A000045 (Fibonacci numbers). - _Arkadiusz Wesolowski_, Jan 08 2012
%H Vincenzo Librandi, <a href="/A017437/b017437.txt">Table of n, a(n) for n = 0..10000</a>
%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(0)=4, a(1)=15, a(n) = 2*a(n-1) - a(n-2). - _Harvey P. Dale_, May 19 2012
%F From _G. C. Greubel_, Sep 18 2019: (Start)
%F G.f.: (4 + 7*x)/(1-x)^2.
%F E.g.f.: (4 + 11*x)*exp(x). (End)
%p seq(11*n+4, n=0..60); # _G. C. Greubel_, Sep 18 2019
%t Range[4, 1000, 11] (* _Vladimir Joseph Stephan Orlovsky_, May 28 2011 *)
%t LinearRecurrence[{2,-1},{4,15},60] (* _Harvey P. Dale_, May 19 2012 *)
%o (Sage) list(range(4, 600, 11)) # _Zerinvary Lajos_, May 21 2009
%o (Magma)[11*n+4: n in [0..60]]; // _Vincenzo Librandi_, Sep 18 2011
%o (PARI) a(n)=11*n+4 \\ _Charles R Greathouse IV_, Oct 07 2015
%o (GAP) List([0..60], n-> 11*n+4); # _G. C. Greubel_, Sep 18 2019
%Y Cf. A008593, A017425.
%Y Powers of the form (11*n+4)^m: this sequence (m=1), A017438 (m=2), A017439 (m=3), A017440 (m=4), A017441 (m=5), A017442 (m=6), A017443 (m=7), A017444 (m=8), A017445 (m=9), A017446 (m=10), A017447 (m=11), A017448 (m=12).
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_
|
