Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #27 Jul 08 2023 16:02:30
%S 8,163,3074,62503,1399684,34588811,939524102,27894275215,900000000008,
%T 31384283767219,1176925259169802,47248516628391479,
%U 2022385242251558924,91957716979980468763,4427218577690292387854,225009351233083599856159
%N a(n) = n + (n+1)*(n+2)^(n+3).
%C Suggested by Karl Vago's contributions to Dario Alpern's list of records.
%H Vincenzo Librandi, <a href="/A143857/b143857.txt">Table of n, a(n) for n = 0..250</a>
%H Dario A. Alpern, <a href="https://www.alpertron.com.ar/ECMREC.HTM">ECM Factorization applet records</a>
%H Dario A. Alpern, <a href="https://www.alpertron.com.ar/ECM.HTM">Factorization using the Elliptic Curve Method</a>
%F a(n) = n + A061250(n+3). - _R. J. Mathar_, Sep 04 2008
%e a(1) = 1+(1+1)*(1+2)^(1+3) = 1+2*3^4 = 163.
%p A143857:=n->n+(n+1)*(n+2)^(n+3); seq(A143857(n), n=0..20); # _Wesley Ivan Hurt_, Mar 20 2014
%t Table[n + (n+1)*(n+2)^(n+3), {n, 0, 20}] (* _Vincenzo Librandi_, Mar 20 2014 *)
%o (Magma) [n+(n+1)*(n+2)^(n+3): n in [0..20]]; // _Vincenzo Librandi_, Dec 27 2010
%o (PARI) vector(21, n, (n-1) + n*(n+1)^(n+2)) \\ _G. C. Greubel_, Nov 09 2019
%o (Sage) [n + (n+1)*(n+2)^(n+3) for n in (0..20)] # _G. C. Greubel_, Nov 09 2019
%o (GAP) List([0..20], n-> n + (n+1)*(n+2)^(n+3)); # _G. C. Greubel_, Nov 09 2019
%Y Cf. A007778, A061250.
%K nonn,easy
%O 0,1
%A _Reinhard Zumkeller_, Sep 03 2008