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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A203513 a(n) = A203312(n+1)/A203312(n). 2

%I #27 Feb 23 2024 02:31:01

%S 3,49,2028,159201,20342448,3850078401,1012487793408,353293863908769,

%T 157973407966483200,88087149666575064369,59928191584204259377152,

%U 48860028872008706126041281

%N a(n) = A203312(n+1)/A203312(n).

%C See A093883 for a discussion and guide to related sequences.

%H G. C. Greubel, <a href="/A203513/b203513.txt">Table of n, a(n) for n = 1..215</a>

%F a(n) ~ exp((n+1)*Pi/(sqrt(3)) - 2*n) * n^(2*n). - _Vaclav Kotesovec_, Sep 07 2023

%t f[j_] := j; z = 12;

%t v[n_] := Product[Product[f[j]^2 - f[j] f[k] + f[k]^2,

%t {j, 1, k - 1}], {k, 2, n}]

%t Table[v[n], {n, 1, z}] (* A203312 *)

%t Table[v[n + 1]/v[n], {n, 1, z}] (* A203513 *)

%t Table[Product[k^2 - k*(n+1) + (n+1)^2, {k, 1, n}], {n, 1, 15}] (* _Vaclav Kotesovec_, Sep 07 2023 *)

%o (Python)

%o from operator import mul

%o from functools import reduce

%o def v(n): return 1 if n==1 else reduce(mul, [reduce(mul, [j**2 - j*k + k**2 for j in range(1, k)]) for k in range(2, n + 1)])

%o print([v(n + 1)//v(n) for n in range(1, 13)]) # _Indranil Ghosh_, Jul 26 2017

%o (Magma) [(&*[(n+1)*(n-j+1) +j^2: j in [1..n]]): n in [1..30]]; // _G. C. Greubel_, Feb 23 2024

%o (SageMath)

%o def A203513(n): return product((n+1)*(n-j+1) +j^2 for j in range(1, n+1))

%o [A203513(n) for n in range(1,31)] # _G. C. Greubel_, Feb 23 2024

%Y Cf. A093883, A203312.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 04 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)