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!)
A203465 a(n) = A203305(n)/A000178(n) where A000178 are superfactorials. 1

%I #15 Sep 19 2023 03:41:07

%S 1,2,24,5376,72253440,192663508746240,345230911480770991226880,

%T 1436598918224589625071929521581588480,

%U 48781096034575545526663437061892218092260229434572800

%N a(n) = A203305(n)/A000178(n) where A000178 are superfactorials.

%H G. C. Greubel, <a href="/A203465/b203465.txt">Table of n, a(n) for n = 1..22</a>

%H R. Chapman, <a href="https://www.jstor.org/stable/2690667">A polynomial taking integer values</a>, Mathematics Magazine, 29 (1996), 121.

%t f[j_]:= 2^j - 1; z = 10;

%t v[n_]:= Product[Product[f[k] - f[j], {j,k-1}], {k,2,n}]

%t d[n_]:= Product[(i-1)!, {i,n}]

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

%t Table[v[n]/d[n], {n,z}] (* A203465 *)

%o (Magma) F:= Factorial; [1] cat [(&*[(&*[2^(k+1) - 2^(j): j in [1..k]])/Factorial(k): k in [1..n-1]]): n in [2..20]]; // _G. C. Greubel_, Sep 19 2023

%o (SageMath) f=factorial; [product(product(2^(k+1) - 2^j for j in range(1, k+1))//factorial(k) for k in range(1, n)) for n in range(1,21)] // _G. C. Greubel_, Sep 19 2023

%Y Cf. A203305.

%K nonn

%O 1,2

%A _Clark Kimberling_, Jan 02 2012

%E Name edited by _Michel Marcus_, May 17 2019

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 May 3 09:50 EDT 2024. Contains 372207 sequences. (Running on oeis4.)