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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226199 a(n) = 7^n + n. 8

%I #26 Mar 01 2024 05:20:20

%S 1,8,51,346,2405,16812,117655,823550,5764809,40353616,282475259,

%T 1977326754,13841287213,96889010420,678223072863,4747561509958,

%U 33232930569617,232630513987224,1628413597910467,11398895185373162,79792266297612021

%N a(n) = 7^n + n.

%C Smallest prime of this form is a(34) = 54116956037952111668959660883.

%C In general, the g.f. of a sequence of numbers of the form k^n+n is (1-x-(k-1)*x^2)/((1-k*x)*(x-1)^2) with main linear recurrence (k+2)*a(n-1) -(2k+1)*a(n-2) +k*a(n-3). - _Bruno Berselli_, Jun 16 2013

%H Vincenzo Librandi, <a href="/A226199/b226199.txt">Table of n, a(n) for n = 0..300</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (9,-15,7).

%F G.f.: (1-x-6*x^2)/((1-7*x)*(1-x)^2).

%F a(n) = 9*a(n-1)-15*a(n-2)+7*a(n-3).

%t Table[7^n + n, {n, 0, 30}] (* or *) CoefficientList[Series[(1 - x - 6 x^2) / ((1 - 7 x) (1 - x)^2), {x, 0, 20}], x]

%o (Magma) [7^n+n: n in [0..20]]; /* or */ I:=[1, 8, 51]; [n le 3 select I[n] else 9*Self(n-1)-15*Self(n-2)+7*Self(n-3): n in [1..30]];

%o (PARI) a(n)=7^n+n \\ _Charles R Greathouse IV_, Oct 07 2015

%Y Cf. numbers of the form k^n+n: A006127 (k=2), A104743 (k=3), A158879 (k=4), A104745 (k=5), A226200 (k=6), this sequence (k=7), A226201 (k=8), A226202 (k=9), A081552 (k=10), A226737 (k=11).

%Y Cf. A199483 (first differences), A370657.

%K nonn,easy

%O 0,2

%A _Vincenzo Librandi_, Jun 16 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 23:03 EDT 2024. Contains 376002 sequences. (Running on oeis4.)