cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A093149 a(1) = 4; a(n) = (n^(n+1)+2*n-3)/(n-1) for n > 1.

This page as a plain text file.
%I A093149 #27 Sep 08 2022 08:45:13
%S A093149 4,9,42,343,3908,55989,960802,19173963,435848052,11111111113,
%T A093149 313842837674,9726655034463,328114698808276,11966776581370173,
%U A093149 469172025408063618,19676527011956855059,878942778254232811940,41660902667961039785745,2088331858752553232964202
%N A093149 a(1) = 4; a(n) = (n^(n+1)+2*n-3)/(n-1) for n > 1.
%C A093149 This sequence represents the first step in which the Gijswijt's sequence (A090822), with a minimum value of n-1, reaches the value n+1 for the first time. For example, the first '3' in A090822 is in step 9, the first '4' in A091787 is in step 42, the first '5' in A091799 is in step 343 and so on. - _Sergio Pimentel_, Jul 15 2015
%p A093149 A093149:=n->(n^(n+1)+2*n-3)/(n-1): (4,seq(A093149(n), n=2..30)); # _Wesley Ivan Hurt_, Jul 15 2015
%t A093149 {4}~Join~Table[(n^(n + 1) + 2 n - 3)/(n - 1), {n, 2, 19}] (* _Michael De Vlieger_, Jul 13 2015 *)
%o A093149 (PARI) main(size)=my(v=vector(size),i); v[1]=4; for(i=2,size, v[i]=(i^(i+1)+2*i-3)/(i-1)); v \\ _Anders Hellström_, Jul 13 2015
%o A093149 (Magma) [4] cat [(n^(n+1)+2*n-3)/(n-1): n in [2..20]]; // _Vincenzo Librandi_, Jul 16 2015
%Y A093149 Cf. A090822, A091787, A091799, A091844.
%K A093149 nonn
%O A093149 1,1
%A A093149 _N. J. A. Sloane_, May 21 2004