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!)
A203434 a(n) = A203433(n)/A000178(n) where A000178=(superfactorials). 3
1, 1, 3, 6, 45, 189, 3402, 30618, 1299078, 25332021, 2507870079, 106698472452, 24487299427734, 2283997201168644, 1209640056157393380, 248218139523497121576, 302358334494179897593596, 136861610819571430116630660 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
R. Chapman, A polynomial taking integer values, Mathematics Magazine, 29 (1996), 121.
MATHEMATICA
f[j_]:= j + Floor[(j+1)/2]; z = 20;
v[n_]:= Product[Product[f[k] - f[j], {j, k-1}], {k, 2, n}]
d[n_]:= Product[(i-1)!, {i, n}]
Table[v[n], {n, z}] (* A203433 *)
Table[v[n+1]/v[n], {n, z}] (* A014402 *)
Table[v[n]/d[n], {n, z}] (* A203434 *)
PROG
(Magma)
Barnes:= func< n | (&*[Factorial(j): j in [1..n-1]]) >;
f:= func< k | (&*[k+1-j+Floor((k+2)/2)-Floor((j+1)/2): j in [1..k]]) >;
[1] cat [(&*[f(k): k in [1..n-1]])/Barnes(n): n in [2..20]]; // G. C. Greubel, Sep 19 2023
(SageMath)
def barnes(n): return product(factorial(j) for j in range(n))
def f(k): return product(k-j+(k//2)-(j//2) for j in range(k))
[product(f(k) for k in range(1, n) )//barnes(n) for n in range(1, 31)] # G. C. Greubel, Sep 19 2023
CROSSREFS
Sequence in context: A133005 A009581 A088674 * A076170 A137775 A038050
KEYWORD
nonn
AUTHOR
Clark Kimberling, Jan 02 2012
STATUS
approved

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 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)