A105750 -id:A105750 - cp's OEIS frontend

A220448 Define a sequence u(n) by u(1)=1; thereafter u(n) = f(n)/f(n-1) where f(n) = (-1)^(n+1)*A105750(n); sequence gives numerator(u(n)).

1, 1, -10, -1, 19, -73, 662, -2795, 281, -4511, 21746, -322921, 1035215, -720817, 1077518, -87995911, -34376687, 929280875, -92673902, 6986985769, -33833494045, 243540693677, -1817775985570, 13097400661955, -27199287430171, 8249498995171439, -112427012362483262, 3008079144099400625, -10365435567354511181

Offset: 1

N. J. A. Sloane, Dec 22 2012

Also u(n) = n*x(n-1)-1, where x(n) is defined in A220447.

			The sequence u(n) begins 1, 1, -10, -1, 19, -73/19, 662/73, -2795/331, 281/43, -4511/281, 21746/4511, ...

V. H. Moll, An arithmetic conjecture on a sequence of arctangent sums, 2012.

Denominator(u(n)) = A220447(n-1).

A220448 := proc(n)
    if n= 1 then
        1 ;
    else
        -A105750(n)/A105750(n-1) ;
        numer(%) ;
    end if;
end proc: # R. J. Mathar, Jan 04 2013

x[n_] := x[n] = If[n == 1, 1, (x[n-1] + n)/(1 - n*x[n-1])];
u[n_] := If[n == 1, 1, n*x[n-1] - 1];
a[n_] := Numerator[u[n]];
Table[a[n], {n, 1, 29}] (* Jean-François Alcover, Aug 09 2023 *)

A101686 a(n) = Product_{i=1..n} (i^2 + 1).

Original entry on oeis.org

1, 2, 10, 100, 1700, 44200, 1635400, 81770000, 5315050000, 435834100000, 44019244100000, 5370347780200000, 778700428129000000, 132379072781930000000, 26078677338040210000000, 5893781078397087460000000, 1514701737148051477220000000

Offset: 0

Ralf Stephan, Dec 13 2004

nonn

Sum of all coefficients in Product_{k=0..n} (x + k^2).
Row sums of triangle of central factorial numbers (A008955).
"HANOWA" is a matrix whose eigenvalues lie on a vertical line. It is an N X N matrix with 2 X 2 blocks with identity matrices in the upper left and lower right blocks and diagonal matrices containing the first N integers in the upper right and lower left blocks. In MATLAB, the following code generates the sequence... for n=0:2:TERMS*2 det(gallery('hanowa',n)) end. - Paul Max Payton, Mar 31 2005
Cilleruelo shows that a(n) is a square only for n = 0 and 3. - Charles R Greathouse IV, Aug 27 2008
a(n) = A231530(n)^2 + A231531(n)^2. - Stanislav Sykora, Nov 10 2013

Edmund Landau, Handbuch der Lehre von der Verteilung der Primzahlen, Chelsea Publishing, NY 1953, pp. 559-561, Section 147. - N. J. A. Sloane, May 29 2014

Stanislav Sykora, Table of n, a(n) for n = 0..252
Javier Cilleruelo, Squares in (1^2+1)...(n^2+1), Journal of Number Theory 128:8 (2008), pp. 2488-2491.
Thang Pang Ern, Finding Squares in a Product of Squares, arXiv:2411.00012 [math.NT], 2024.
Erhan Gürela and Ali Ulas Özgür Kisisel, A note on the products (1^mu + 1)(2^mu + 1)···(n^mu + 1), Journal of Number Theory, Volume 130, Issue 1, January 2010, Pages 187-191.
V. H. Moll, An arithmetic conjecture on a sequence of arctangent sums, 2012.

Equals 2 * A051893(n+1), n>0. Cf. A156648.
Cf. A255433, A255434, A255435, A003703, A009454.
Cf. A105750, A105751.

p := n -> mul(x^2+1, x=0..n):
seq(p(i), i=0..14); # Gary Detlefs, Jun 03 2010

Table[Product[k^2+1,{k,0,n}],{n,0,20}] (* Vaclav Kotesovec, Nov 11 2013 *)
Table[Pochhammer[I, n + 1] Pochhammer[-I, n + 1], {n, 0, 20}] (* Vladimir Reshetnikov, Oct 25 2015 *)
Table[Abs[Pochhammer[1 + I, n]]^2, {n, 0, 20}] (* Vaclav Kotesovec, Oct 16 2016 *)

a(n)=prod(k=1,n,k^2+1) \\ Charles R Greathouse IV, Aug 27 2008

{a(n)=if(n==0, 1, 1-polcoeff(sum(k=0, n-1, a(k)*x^k/prod(j=1, k+1, 1+j^2*x+x*O(x^n))), n))} \\ Paul D. Hanna, Jan 07 2013

from math import prod
def A101686(n): return prod(i**2+1 for i in range(1,n+1)) # Chai Wah Wu, Feb 22 2024

G.f.: 1/(1-x) = Sum_{n>=0} a(n)*x^n / Product_{k=1..n+1} (1 + k^2*x). - Paul D. Hanna, Jan 07 2013
G.f.: 1 + x*(G(0) - 1)/(x-1) where G(k) = 1 - ((k+1)^2+1)/(1-x/(x - 1/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Jan 15 2013
a(n) ~ (n!)^2 * sinh(Pi)/Pi. - Vaclav Kotesovec, Nov 11 2013
From Vladimir Reshetnikov, Oct 25 2015: (Start)
a(n) = Gamma(n+1+i)*Gamma(n+1-i)*sinh(Pi)/Pi.
a(n) ~ 2*exp(-2*n)*n^(2*n+1)*sinh(Pi).
G.f. for 1/a(n): hypergeom([1], [1-i, 1+i], x).
E.g.f. for a(n)/n!: hypergeom([1-i, 1+i], [1], x), where i=sqrt(-1).
D-finite with recurrence: a(0) = 1, a(n) = (n^2+1)*a(n-1). (End)
a(n+3)/a(n+2) - 2 a(n+2)/a(n+1) + a(n+1)/a(n) = 2. - Robert Israel, Oct 25 2015
a(n) = A003703(n+1)^2 + A009454(n+1)^2. - Vladimir Reshetnikov, Oct 15 2016
a(n) = A105750(n)^2 + A105751(n)^2. - Ridouane Oudra, Dec 15 2021

More terms from Charles R Greathouse IV, Aug 27 2008
Simpler definition from Gary Detlefs, Jun 03 2010
Entry revised by N. J. A. Sloane, Dec 22 2012
Minor edits by Vaclav Kotesovec, Mar 13 2015

A231531 Imaginary part of Product_{k = 1..n} (k + i), i = sqrt(-1).

Original entry on oeis.org

0, 1, 3, 10, 40, 190, 1050, 6620, 46800, 365300, 3103100, 28269800, 271627200, 2691559000, 26495469000, 238131478000, 1394099824000, -15194495654000, -936096296850000, -29697351895900000, -819329864480400000, -21683886333440500000, -570263312237604700000, -15145164178973569000000, -409583160925827252000000

Offset: 0

Stanislav Sykora, Nov 10 2013

Extension of factorial(n) to factim(n,m) defined by the recurrence a(0)=1, a(n)=a(n-1)*(n+m*i). Hence n! = factim(n,0), while the current sequence shows the imaginary parts of factim(n,1). The real parts are in A231530 and squares of magnitudes are in A101686.
From Peter Bala, Jun 01 2023: (Start)
Compare with A105751(n) = the imaginary part of Product_{k = 0..n} (1 + k*sqrt(-1)). Moll (2012) studied the prime divisors of the terms of A105750 -  the real part of Product_{k = 0..n} (1 + k*sqrt(-1)) - and divided the primes into three types. Calculation suggests that a similar division holds in this case.
Type 1: the prime p does not divide any element of the sequence. It appears that for this sequence, unlike in A105750, there are no type 1 primes; i.e., every prime p divides some term of the sequence.
Type 2: primes p such that the p-adic valuation v_p(a(n)) has asymptotically linear behavior. An example is given below.
We conjecture that the set of type 2 primes consists of p = 2 and all primes of the form p == 1 (mod 4). See A002144.
Moll's conjecture 5.5 about type 2 primes extends to this sequence and takes the form:
(i) the 2-adic valuation v_2(a(n)) ~ n/4 as n -> oo.
(ii) for a type 2 prime p, the p-adic valuation v_p(a(n)) ~ n/(p - 1) as n -> oo.
Type 3: primes p such that the sequence of p-adic valuations {v_p(a(n)) : n >= 0} exhibits an oscillatory behavior (this phrase is not precisely defined). An example is given below.
We conjecture that the set of type 3 primes is A002145, primes of the form 4*k + 3. (End)

			factim(5,1) = -90+190*i. Hence a(5) = 190.
From _Peter Bala_, Jun 01 2023: (Start)
Asymptotic linearity for the type 2 prime p = 5: the sequence of 5-adic valuations [ v_5(a(n)) : n = 1..100] = [0, 0, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 5, 5, 5, 6, 5, 6, 6, 7, 6, 6, 7, 7, 7, 8, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 11, 11, 11, 13, 11, 12, 12, 13, 12, 12, 13, 13, 13, 14, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 18, 19, 18, 18, 18, 19, 19, 19, 20, 19, 20, 21, 20, 20, 20, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 24, 25, 24, 24, 24, 25, 25, 25].
Note that v_5(a(100)) = 25 = 100/(5 - 1), in line with Moll's conjecture 5.5 above.
Oscillatory behavior for the type 3 prime p = 3: the sequence of 3-adic valuations [ v_3(a(n)) : n = 1..100] = [0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 3, 0, 0, 0, 3, 0, 2, 0, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 2, 0, 3, 0, 0, 0, 3, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 4, 0, 0, 0, 4, 0, 2, 0, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0]. It appears that v_3(a(n)) = 0 unless n == 0 or 2 (mod 6). (End)

Stanislav Sykora, Table of n, a(n) for n = 0..440
Victor H. Moll, An arithmetic conjecture on a sequence of arctangent sums, 2012, see f_n.

Cf. A231530 (real parts), A101686 (squares of magnitudes), A003703, A105750, A105751.

See A242651, A242652 for a pair of similar sequences.

seq(simplify(-sinh(Pi)*Im(I!*(n-I)!)/Pi), n=0..19); # Peter Luschny, Oct 23 2015

Table[Im[Pochhammer[1+I, n]], {n, 0, 20}]
Table[Sum[(-1)^(n+k) StirlingS1[n+1, 2k], {k, 0, (n+1)/2}], {n, 0, 20}] (* Vladimir Reshetnikov, Oct 22 2015 *)

Factim(nmax, m)={local(a, k); a=vector(nmax); a[1]=1+0*I;
  for (k=2, nmax, a[k]=a[k-1]*(k-1+m*I); ); return(a); }
a = Factim(1000,1); imag(a)

t(n) = if( n<0, 0, n! * polcoeff(cos(log(1+x+x*O(x^n))), n));
vector(50, n, n--; (-1)^n*t(n+1)) \\ Altug Alkan, Oct 22 2015

from sympy.functions.combinatorial.numbers import stirling
def A231531(n): return sum(stirling(n+1,k<<1,kind=1)*(1 if k&1 else -1) for k in range((n+1>>1)+1)) # Chai Wah Wu, Feb 22 2024

From Vladimir Reshetnikov, Oct 22 2015: (Start)
a(n) = Im((1+i)_n) = -Re(Gamma(i)*Gamma(n+1-i))*sinh(Pi)/Pi, where (a)_n is the Pochhammer symbol, i=sqrt(-1).
a(n) = (-1)^n*A003703(n+1).
E.g.f.: sin(log(1-x))/(x-1). (End)
P-recursive: a(n) = (2*n - 1)*a(n-1) - (n^2 - 2*n + 2)*a(n-2) with a(0) = 0 and a(1) = 1. - Peter Bala, Jun 01 2023

A105751 Imaginary part of Product_{k=0..n} (1 + k*i), i = sqrt(-1).

Original entry on oeis.org

0, 1, 3, 0, -40, -90, 1050, 6160, -46800, -549900, 3103100, 67610400, -271627200, -11186357000, 26495469000, 2416003824000, -1394099824000, -662595375078000, -936096296850000, 225382826562400000, 819329864480400000, -93217812901913700000, -570263312237604700000

Offset: 0

Paul Barry, Apr 18 2005

From Peter Bala, Jun 01 2023: (Start)
Compare with A105750(n) = the real part of Product_{k = 0..n} (1 + k*sqrt(-1)). Moll (2012) studied the prime divisors of the terms of A105750 and divided the primes into three classes. Numerical calculation suggests that a similar division holds in this case.
Type 1: primes p that do not divide any element of the sequence {a(n)}.
In this case, unlike in A105750, the set of type 1 primes is empty; that is, every prime p divides some term of this sequence.
Type 2: primes p such that the p-adic valuation v_p(a(n)) has asymptotically linear behavior. An example is given below.
We conjecture that the set of type 2 primes consists of primes p == 1 (mod 4), equivalently, rational primes that split in the field extension Q(sqrt(-1)) of Q, together with the prime p = 2, which ramifies in Q(sqrt(-1)). See A002144.
Moll's conjecture 5.5 extends to this sequence and takes the form:
(i) the 2-adic valuation v_2(a(n)) ~ n/4 as n -> oo.
(ii) for the other primes of type 2, the p-adic valuation v_p(a(n)) ~ n/(p - 1) as n -> oo.
Type 3: primes p such that the sequence of p-adic valuations {v_p(a(n)) : n >= 0} exhibits an oscillatory behavior (this phrase is not precisely defined). An example is given below.
We conjecture that the set of type 3 primes consists of primes p == 3 (mod 4), equivalently, rational primes that remain inert in the field extension Q(sqrt(-1)) of Q. See A002145. (End)

			From _Peter Bala_, Jun 01 2023: (Start)
The sequence of 5-adic valuations [v_5(a(n)) : n = 4..100] = [1, 1, 2, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 12, 11, 11, 13, 11, 12, 13, 13, 12, 12, 14, 13, 13, 14, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 18, 18, 18, 18, 18, 20, 19, 19, 20, 19, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 24, 25, 25, 24, 24, 25, 25, 25].
Note that v_5(a(100)) = 25 = 100/(5 - 1), in agreement with the asymptotic behavior conjectured above.
The sequence of 3-adic valuations [v_3(a(n)) : n >= 4] begins [0, 2, 1, 0, 2, 2, 0, 1, 2, 0, 2, 1, 0, 2, 2, 0, 1, 2, 0, 3, 1, 0, 3, 3, 0, 1, 3, 0, 2, 1, 0, 2, 2, 0, 1, 2, 0, 2, 1, 0, 2, 2, 0, 1, 2, 0, 3, ...], exhibiting the oscillatory behavior for type 3 primes conjectured above. (End)

Seiichi Manyama, Table of n, a(n) for n = 0..450

Cf. A003703, A009454, A048994, A105750, A164652, A231531, A363409 - A363416.

a:= proc(n) option remember; `if`(n<2, n,
      ((2*n-1)*a(n-1)-(n^2-2*n+2)*n*a(n-2))/(n-1))
    end:
seq(a(n), n=0..25);  # Alois P. Heinz, Apr 11 2018

Table[Im[Product[1+k*I,{k,0,n}]],{n,0,22}] (* James C. McMahon, Jan 27 2024 *)

a(n) = imag(prod(k=0, n, 1+k*I)); \\ Michel Marcus, Apr 11 2018

from sympy.functions.combinatorial.numbers import stirling
def A105751(n): return sum(stirling(n+1,n-(k<<1),kind=1)*(-1 if k&1 else 1) for k in range((n>>1)+1)) # Chai Wah Wu, Feb 22 2024

a(n) = ((2*n-1)*a(n-1)-(n^2-2*n+2)*n*a(n-2))/(n-1) for n > 1, a(n) = n for n < 2. - Alois P. Heinz, Apr 11 2018
From Peter Bala, May 27 2023:(Start)
a(n) = Sum_{k = 0..floor((n+1)/2)} (-1)^k*|Stirling1(n+1, n-2*k)|, where Stirling1(n, k) = A048994(n,k).
The triangular number n*(n+1)/2 divides a(n). See A164652. In particular, if p is an odd prime then p divides a(p).
a(2*n) = (-1)^(n+1)*A003703(2*n+1) for n >= 0.
a(2*n+1) = (-1)^(n+1)*A009454(2*n+2) for n >= 0. (End)

A363409 a(n) = the real part of Product_{k = 1..n} (1 + k*sqrt(-2)).

Original entry on oeis.org

1, 1, -3, -21, 27, 927, 387, -78111, -211167, 10887129, 61228629, -2278564101, -20995423317, 669639978711, 9055735268283, -263207953694367, -4900375484030367, 133357760824723281, 3278778524907635277, -84617763517115570709, -2669012118280627019109

Offset: 0

Peter Bala, Jun 01 2023

Compare with A105750(n) = the real part of Product_{k = 0..n} 1 + k*sqrt(-1).
Moll (2012) studied the prime divisors of the terms of A105750 and divided the primes into three classes. Numerical calculation suggests that a similar division also holds in this case.
Type 1: primes that do not divide any element of the sequence {a(n)}.
We conjecture that the set of type 1 primes begins {2, 5, 13, 23, 29, 31, 47, 53, 61, 71, 101, ...}.
Type 2: primes p such that the p-adic valuation v_p(a(n)) has asymptotically linear behavior. An example is given below.
We conjecture that the set of type 2 primes consists of primes p == 1 or 3 (mod 8), i.e., rational primes that split in the field extension Q(sqrt(-2)) of Q. See A033200.
Moll's conjecture 5.5 extends to this sequence and takes the form: for prime p == 1 or 3 (mod 8), the p-adic valuation v_p(a(n)) ~ n/(p - 1) as n -> oo.
Type 3: primes p such that the sequence of p-adic valuations {v_p(a(n)) : n >= 0} exhibits an oscillatory behavior (this phrase is not precisely defined). An example is given below.
We conjecture that the set of type 3 primes begins {7, 37, 79, 103, ...}.
Taken together, the type 1 and type 3 primes appear to consist of all primes p == 5 or 7 (mod 8), that is, the rational primes that remain inert in the field extension Q(sqrt(-2)) of Q, together with the prime p = 2, which ramifies in Q(sqrt(-2)). See A003628.

			Type 2 prime p = 3: the sequence of 3-adic valuations [v_3(a(n)) : n = 0..100] = [0, 0, 1, 1, 3, 2, 2, 3, 5, 5, 4, 5, 5, 6, 6, 6, 9, 9, 9, 10, 10, 10, 11, 11, 11, 13, 13, 13, 14, 14, 14, 15, 15, 15, 17, 17, 17, 18, 18, 18, 19, 19, 19, 22, 22, 22, 23, 23, 23, 24, 24, 24, 26, 26, 26, 27, 27, 27, 28, 28, 28, 30, 30, 30, 31, 31, 31, 32, 32, 32, 37, 36, 36, 40, 37, 37, 38, 38, 38, 40, 40, 40, 41, 41, 41, 42, 42, 42, 47, 44, 44, 46, 45, 45, 46, 46, 46, 49, 49, 49, 50].
Note that v_3(a(100)) = 50 = 100/(3 - 1) in agreement with the asymptotic behavior for type 2 primes conjectured above.
Type 3 prime p = 7: the sequence of 7-adic valuations [v_7(a(n)) : n = 0..101] = [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1], showing the oscillatory behavior for type 3 primes conjectured above. It appears that v_7(a(7*n+3)) = 1 otherwise v_7(a(n)) = 0.

Victor H. Moll, An arithmetic conjecture on a sequence of arctangent sums, 2012, see f_n.

Cf. A105750, A363410 - A363416.

a := proc(n) option remember; if n = 0 then 1 elif n = 1 then 1 else ( (2*n - 1)*a(n-1) - n*(2*n^2 - 4*n + 3)*a(n-2) )/(n - 1) end if; end:
seq(a(n), n = 0..20);

Table[Re[Product[1+k*Sqrt[-2], {k, 0, n}]], {n, 0, 20}] (* James C. McMahon, Jan 28 2024 *)

a(n) = Sum_{k = 0..floor((n+1)/2)} (-2)^k*Stirling1(n+1, n+1-2*k).
a(n+1)/a(n) = 1 - (2*n + 2)*1/sqrt(2)*tan( Sum_{k = 1..n} arctan(sqrt(2)*k) ).
(n - 1)*a(n) = (2*n - 1)*a(n-1) - n*(2*n^2 - 4*n + 3)*a(n-2) with a(0) = 1 and a(1) = 1.

A363416 a(n) = 1/sqrt(5) * the imaginary part of Product_{k = 0..n} 1 + k*sqrt(-5).

Original entry on oeis.org

0, 1, 3, -24, -240, 1890, 40446, -311472, -12038544, 86898420, 5614173180, -36099955584, -3786960576672, 20307572439336, 3492389655843480, -14110473458954880, -4223754447793582464, 10493742733654512528, 6488421280167604253616, -4618066393756887442560, -12344309538368967592151040

Offset: 0

Peter Bala, Jun 01 2023

Compare with A105751(n) = the imaginary part of Product_{k = 0..n} 1 + k*sqrt(-1).
Moll (2012) studied the prime divisors of the terms of A105750 - the real part of Product_{k = 0..n} 1 + k*sqrt(-1) - and divided the primes into three classes. Numerical calculation suggests that a similar division holds in this case.
Type 1: primes p that do not divide any element of the sequence {a(n)}.
We conjecture that in this case, unlike in A105750, the set of type 1 primes is empty; that is, every prime p divides some term of this sequence.
Type 2: primes p such that the p-adic valuation v_p(a(n)) has asymptotically linear behavior. An example is given below.
We conjecture that the set of type 2 primes consists of primes p == 1, 3, 7 or 9 (mod 20), equivalently, rational primes that split in the field extension Q(sqrt(-5)) of Q, together with the prime p = 2. See A139513.
Moll's conjecture 5.5 extends to this sequence and takes the form:
(i) the 2-adic valuation v_2(a(n)) ~ n/4 as n -> oo.
(ii) for the other primes of type 2, the p-adic valuation v_p(a(n)) ~ n/(p - 1) as n -> oo.
Type 3: primes p such that the sequence of p-adic valuations {v_p(a(n)) : n >= 0} exhibits an oscillatory behavior (this phrase is not precisely defined). An example is given below.
We conjecture that the set of type 3 primes consists of primes p == 11, 13, 17 or 19 (mod 20), equivalently, primes that remain inert in the field extension Q(sqrt(-5)) of Q, together with the prime p = 5, which ramifies in Q(sqrt(-5)). See A003626.

			Type 2 prime p = 3: the sequence of 3-adic valuations [v_3(a(n)) : n = 1..80] = [0, 1, 1, 1, 3, 3, 3, 4, 4, 4, 5, 5, 5, 7, 7, 7, 8, 8, 8, 9, 9, 9, 12, 12, 12, 13, 13, 13, 14, 14, 14, 16, 16, 16, 17, 17, 17, 18, 18, 18, 20, 20, 20, 21, 21, 21, 22, 22, 22, 25, 25, 25, 26, 26, 26, 27, 27, 27, 29, 29, 29, 30, 30, 30, 31, 31, 31, 33, 33, 33, 34, 34, 34, 35, 35, 35, 39, 39, 41, 40, 40].
Note that v_3(a(80)) = 40 = 80/(3 - 1), in agreement with the asymptotic behavior for type 2 primes conjectured above.
Type 3 prime p = 11: the sequence of 11-adic valuations [v_11(a(n)) : n = 1..121] = [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 2], showing the oscillatory behavior for type 3 primes conjectured above.

Victor H. Moll, An arithmetic conjecture on a sequence of arctangent sums, 2012, see f_n.

Cf. A105750, A105751, A363409 - A363415

a := proc(n) option remember; if n = 0 then 0 elif n = 1 then 1 else (
(2*n - 1)*a(n-1) - n*(5*n^2 - 10*n + 6)*a(n-2) )/(n - 1) end if; end:
seq(a(n), n = 0..20);

P-recursive: (n - 1)*a(n) = (2*n - 1)*a(n-1) - n*(5*n^2 - 10*n + 6)*a(n-2) with
a(0) = 0 and a(1) = 1.
a(n) = Sum_{k = 0..floor((n+1)/2)} (-5)^k*Stirling1(n+1,n-2*k).

A370547 a(n) is the numerator of the real part of Product_{k=1..n} (1/k + i) where i is the imaginary unit.

Original entry on oeis.org

1, -1, -5, -5, 19, 73, -331, -2795, 18265, 58643, -141349, -4197973, 1035215, 61269445, -9158903, -1495930487, -34376687, 26949145375, 33594289475, -1013112936505, -4905856636525, 459074207581145, 1713253866399725, -6497000065206625, -51270656805872335, 239235470859971731

Offset: 1

Hugo Pfoertner, Feb 22 2024

			   n  a(n)
      A370547(n)      A370549(n)
          / A370548(n)      / A370550(n)
   1     1/1              +1/1     *i
   2    -1/2              +3/2     *i
   3    -5/3              +0/1     *i
   4    -5/12             -5/3     *i
   5    19/12             -3/4     *i
   6    73/72            +35/24    *i
   7  -331/252           +11/9     *i
   8 -2795/2016          -65/56    *i
   9 18265/18144       -3055/2016  *i
  10 58643/36288       +4433/5184  *i

Cf. A105750, A370548, A370549, A370550.

a370547(n) = numerator(real(prod(k=1,n,1/k+I)))

from math import factorial, gcd
from sympy.functions.combinatorial.numbers import stirling
def A370547(n): return (a:=sum(stirling(n+1,n+1-(k<<1),kind=1)*(-1 if k&1 else 1) for k in range((n+1>>1)+1)))//gcd(a,factorial(n)) # Chai Wah Wu, Feb 22 2024

a(n) = numerator of A105750(n)/n!. - Chai Wah Wu, Feb 22 2024

A370548 a(n) is the denominator of the real part of Product_{k=1..n} (1/k + i) where i is the imaginary unit.

Original entry on oeis.org

1, 2, 3, 12, 12, 72, 252, 2016, 18144, 36288, 199584, 2395008, 2395008, 33530112, 50295168, 804722688, 804722688, 14485008384, 137607579648, 550430318592, 11559036690432, 254298807189504, 2924436282679296, 3694024778121216, 70186470784303104, 140372941568606208

Offset: 1

Hugo Pfoertner, Feb 22 2024

			See A370547.

Cf. A105750, A370547, A370549, A370550.

a370548(n) = denominator(real(prod(k=1, n, 1/k+I)))

from math import factorial, gcd
from sympy.functions.combinatorial.numbers import stirling
def A370548(n): return (a:=factorial(n))//gcd(a,sum(stirling(n+1,n+1-(k<<1),kind=1)*(-1 if k&1 else 1) for k in range((n+1>>1)+1))) # Chai Wah Wu, Feb 22 2024

a(n) = denominator of A105750(n)/n!. - Chai Wah Wu, Feb 22 2024

A220449 Define u(n) as in A220448; then a(1)=1, thereafter a(n) = u(n)*a(n-1).

Original entry on oeis.org

1, 1, -10, 10, 190, -730, -6620, 55900, 365300, -5864300, -28269800, 839594600, 2691559000, -159300557000, -238131478000, 38894192662000, -15194495654000, -11911522255750000, 29697351895900000, 4477959179352100000, -21683886333440500000, -2029107997508660900000, 15145164178973569000000

Offset: 1

N. J. A. Sloane, Dec 22 2012

sign

The reason for including this sequence as well as A105750 is that the values of this sequence modulo various primes are of interest (see Moll).

N. J. A. Sloane, Table of n, a(n) for n = 1..100
V. H. Moll, An arithmetic conjecture on a sequence of arctangent sums, 2012. See f_n.

Cf. A105750, A220446, A220447, A220448, A220450, A220451.

x:=proc(n) option remember;
if n=1 then 1 else (x(n-1)+n)/(1-n*x(n-1)); fi; end;
f:=proc(n) option remember; global x;
if n = 1 then 1 else n*x(n-1)*f(n-1)-f(n-1); fi; end;
[seq(f(n),n=1..30)];

A105750(n) = (-1)^(n+1)*a(n).

Define x(n) as in A220447. Then x(n) = (a(n+1)+a(n))/((n+1)*a(n)).

A363410 a(n)= 1/sqrt(2) * the imaginary part of Product_{k = 1..n} (1 + k*sqrt(-2)).

Original entry on oeis.org

0, 1, 3, -6, -90, 45, 5607, 8316, -616572, -2517075, 106354215, 779869134, -26562900078, -299503403199, 9075456298755, 144911485323000, -4066415773786872, -87372799002303111, 2313066895842715947, 64609858869087786210, -1627745411473223627970

Offset: 0

Peter Bala, Jun 01 2023

Compare with A105751(n) = the imaginary part of Product_{k = 0..n} 1 + k*sqrt(-1).
Moll (2012) studied the prime divisors of the terms of A105750 - the real part of Product_{k = 0..n} 1 + k*sqrt(-1) - and divided the primes into three classes. Numerical calculation suggests that a similar division holds in this case.
Type 1: primes p that do not divide any element of the sequence {a(n)}.
We conjecture that in this case, unlike in A105750, the set of type 1 primes is empty; that is, every prime p divides some term of this sequence.
Type 2: primes p such that the p-adic valuation v_p(a(n)) has asymptotically linear behavior. An example is given below.
We conjecture that the set of type 2 primes consists of primes p == 1 or 3 (mod 8), equivalently, rational primes that split in the field extension Q(sqrt(-2)) of Q. See A033200.
Moll's conjecture 5.5 extends to this sequence: for primes p of type 2, the p-adic valuation v_p(a(n)) ~ n/(p - 1) as n -> oo.
Type 3: primes p such that the sequence of p-adic valuations {v_p(a(n)) : n >= 0} exhibits an oscillatory behavior (this phrase is not precisely defined). An example is given below.
We conjecture that the set of type 3 primes consists of primes p == 5 or 7 (mod 8), equivalently, primes that remain inert in the field extension Q(sqrt(-2)) of Q, together with the prime p = 2, which ramifies in Q(sqrt(-2)). See A033203.

			Type 2 prime p = 3: the sequence of 3-adic valuations [v_3(n) : n = 1..100] =  [0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 5, 5, 6, 6, 6, 9, 9, 9, 10, 10, 10, 11, 11, 11, 13, 13, 13, 14, 14, 14, 15, 15, 15, 17, 17, 17, 18, 18, 18, 19, 19, 19, 22, 22, 22, 23, 23, 23, 24, 24, 24, 26, 26, 26, 27, 27, 27, 28, 28, 28, 30, 30, 30, 31, 31, 31, 32, 32, 32, 36, 36, 36, 37, 37, 37, 38, 38, 38, 41, 40, 40, 42, 41, 41, 42, 42, 42, 44, 44, 44, 45, 45, 45, 46, 46, 46, 49, 49, 49, 50].
Note that v_3(a(100)) = 50 = 100/(3 - 1), in agrement with the asymptotic growth for type 2 primes conjectured above.
Type 3 prime p = 5: the sequence of 5-adic valuations [v_5(n) : n = 1..100] = [0, 0, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 0, 1, 3, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 0, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 0, 1, 2, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 0, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 0, 1, 2, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 0, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 0, 1, 2, 0, 0, 0, 1, 1, 0, 0, 0, 2, 2], showing the oscillatory behavior for type 3 primes conjectured above.

Victor H. Moll, An arithmetic conjecture on a sequence of arctangent sums, 2012, see f_n.

Cf. A105750, A105751, A363409 - A363416.

a := proc(n) option remember; if n = 0 then 0 elif n = 1 then 1 else ( (2*n - 1)*a(n-1) - n*(2*n^2 - 4*n + 3)*a(n-2) )/(n - 1) end if; end:
seq(a(n), n = 0..20);

(n - 1)*a(n) = (2*n - 1)*a(n-1) - n*(2*n^2 - 4*n + 3)*a(n-2) with a(0) = 0 and a(1) = 1.

a(n) = Sum_{k = 0..floor((n+1)/2)} (-2)^k*Stirling1(n+1,n+1-2*k).

cp's OEIS Frontend

A220448 Define a sequence u(n) by u(1)=1; thereafter u(n) = f(n)/f(n-1) where f(n) = (-1)^(n+1)*A105750(n); sequence gives numerator(u(n)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A101686 a(n) = Product_{i=1..n} (i^2 + 1).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

A231531 Imaginary part of Product_{k = 1..n} (k + i), i = sqrt(-1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Formula

A105751 Imaginary part of Product_{k=0..n} (1 + k*i), i = sqrt(-1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A363409 a(n) = the real part of Product_{k = 1..n} (1 + k*sqrt(-2)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A363416 a(n) = 1/sqrt(5) * the imaginary part of Product_{k = 0..n} 1 + k*sqrt(-5).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula