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.

Showing 1-9 of 9 results.

A000178 Superfactorials: product of first n factorials.

Original entry on oeis.org

1, 1, 2, 12, 288, 34560, 24883200, 125411328000, 5056584744960000, 1834933472251084800000, 6658606584104736522240000000, 265790267296391946810949632000000000, 127313963299399416749559771247411200000000000, 792786697595796795607377086400871488552960000000000000
Offset: 0

Views

Author

Keywords

Comments

a(n) is also the Vandermonde determinant of the numbers 1,2,...,(n+1), i.e., the determinant of the (n+1) X (n+1) matrix A with A[i,j] = i^j, 1 <= i <= n+1, 0 <= j <= n. - Ahmed Fares (ahmedfares(AT)my-deja.com), May 06 2001
a(n) = (1/n!) * D(n) where D(n) is the determinant of order n in which the (i,j)-th element is i^j. - Amarnath Murthy, Jan 02 2002
Determinant of S_n where S_n is the n X n matrix S_n(i,j) = Sum_{d|i} d^j. - Benoit Cloitre, May 19 2002
Appears to be det(M_n) where M_n is the n X n matrix with m(i,j) = J_j(i) where J_k(n) denote the Jordan function of row k, column n (cf. A059380(m)). - Benoit Cloitre, May 19 2002
a(2n+1) = 1, 12, 34560, 125411328000, ... is the Hankel transform of A000182 (tangent numbers) = 1, 2, 16, 272, 7936, ...; example: det([1, 2, 16, 272; 2, 16, 272, 7936; 16, 272, 7936, 353792; 272, 7936, 353792, 22368256]) = 125411328000. - Philippe Deléham, Mar 07 2004
Determinant of the (n+1) X (n+1) matrix whose i-th row consists of terms 1 to n+1 of the Lucas sequence U(i,Q), for any Q. When Q=0, the Vandermonde matrix is obtained. - T. D. Noe, Aug 21 2004
Determinant of the (n+1) X (n+1) matrix A whose elements are A(i,j) = B(i+j) for 0 <= i,j <= n, where B(k) is the k-th Bell number, A000110(k) [I. Mezo, JIS 14 (2011) # 11.1.1]. - T. D. Noe, Dec 04 2004
The Hankel transform of the sequence A090365 is A000178(n+1); example: det([1,1,3; 1,3,11; 3,11,47]) = 12. - Philippe Deléham, Mar 02 2005
Theorem 1.3, page 2, of Polynomial points, Journal of Integer Sequences, Vol. 10 (2007), Article 07.3.6, provides an example of an Abelian quotient group of order (n-1) superfactorial, for each positive integer n. The quotient is obtained from sequences of polynomial values. - E. F. Cornelius, Jr. (efcornelius(AT)comcast.net), Apr 09 2007
Starting with offset 1 this is a 'Matryoshka doll' sequence with alpha=1, the multiplicative counterpart to the additive A000292. seq(mul(mul(i,i=alpha..k), k=alpha..n),n=alpha..12). - Peter Luschny, Jul 14 2009
For n>0, a(n) is also the determinant of S_n where S_n is the n X n matrix, indexed from 1, S_n(i,j)=sigma_i(j), where sigma_k(n) is the generalized divisor sigma function: A000203 is sigma_1(n). - Enrique Pérez Herrero, Jun 21 2010
a(n) is the multiplicative Wiener index of the (n+1)-vertex path. Example: a(4)=288 because in the path on 5 vertices there are 3 distances equal to 2, 2 distances equal to 3, and 1 distance equal to 4 (2*2*2*3*3*4=288). See p. 115 of the Gutman et al. reference. - Emeric Deutsch, Sep 21 2011
a(n-1) = Product_{j=1..n-1} j! = V(n) = Product_{1 <= i < j <= n} (j - i) (a Vandermondian V(n), see the Ahmed Fares May 06 2001 comment above), n >= 1, is in fact the determinant of any n X n matrix M(n) with entries M(n;i,j) = p(j-1,x = i), 1 <= i, j <= n, where p(m,x), m >= 0, are monic polynomials of exact degree m with p(0,x) = 1. This is a special x[i] = i choice in a general theorem given in Vein-Dale, p. 59 (written for the transposed matrix M(n;j,x_i) = p(i-1,x_j) = P_i(x_j) in Vein-Dale, and there a_{k,k} = 1, for k=1..n). See the Aug 26 2013 comment under A049310, where p(n,x) = S(n,x) (Chebyshev S). - Wolfdieter Lang, Aug 27 2013
a(n) is the number of monotonic magmas on n elements labeled 1..n with a symmetric multiplication table. I.e., Product(i,j) >= max(i,j); Product(i,j) = Product(j,i). - Chad Brewbaker, Nov 03 2013
The product of the pairwise differences of n+1 integers is a multiple of a(n) [and this does not hold for any k > a(n)]. - Charles R Greathouse IV, Aug 15 2014
a(n) is the determinant of the (n+1) X (n+1) matrix M with M(i,j) = (n+j-1)!/(n+j-i)!, 1 <= i <= n+1, 1 <= j <= n+1. - Stoyan Apostolov, Aug 26 2014
All terms are in A064807 and all terms after a(2) are in A005101. - Ivan N. Ianakiev, Sep 02 2016
Empirical: a(n-1) is the determinant of order n in which the (i,j)-th entry is the (j-1)-th derivative of x^(x+i-1) evaluated at x=1. - John M. Campbell, Dec 13 2016
Empirical: If f(x) is a smooth, real-valued function on an open neighborhood of 0 such that f(0)=1, then a(n) is the determinant of order n+1 in which the (i,j)-th entry is the (j-1)-th derivative of f(x)/((1-x)^(i-1)) evaluated at x=0. - John M. Campbell, Dec 27 2016
Also the automorphism group order of the n-triangular honeycomb rook graph. - Eric W. Weisstein, Jul 14 2017
Is the zigzag Hankel transform of A000182. That is, a(2*n+1) is the Hankel transform of A000182 and a(2*n+2) is the Hankel transform of A000182(n+1). - Michael Somos, Mar 11 2020
Except for n = 0, 1, superfactorial a(n) is never a square (proof in link Mabry and Cormick, FFF 4 p. 349); however, when k belongs to A349079 (see for further information), there exists m, 1 <= m <= k such that a(k) / m! is a square. - Bernard Schott, Nov 29 2021

Examples

			a(3) = (1/6)* | 1 1 1 | 2 4 8 | 3 9 27 |
a(7) = n! * a(n-1) = 7! * 24883200 = 125411328000.
a(12) = 1! * 2! * 3! * 4! * 5! * 6! * 7! * 8! * 9! * 10! * 11! * 12!
= 1^12 * 2^11 * 3^10 * 4^9 * 5^8 * 6^7 * 7^6 * 8^5 * 9^4 * 10^3 * 11^2 * 12^1
= 2^56 * 3^26 * 5^11 * 7^6 * 11^2.
G.f. = 1 + x + 2*x^2 + 12*x^3 + 288*x^4 + 34560*x^5 + 24883200*x^6 + ...
		

References

  • Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 545.
  • Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 135-145.
  • A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 50.
  • R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 231.
  • H. J. Ryser, Combinatorial Mathematics. Mathematical Association of America, Carus Mathematical Monograph 14, 1963, p. 53.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • R. Vein and P. Dale, Determinants and Their Applications in Mathematical Physics, Springer, 1999.

Crossrefs

Programs

  • Magma
    [&*[Factorial(k): k in [0..n]]: n in [0..20]]; // Bruno Berselli, Mar 11 2015
    
  • Maple
    A000178 := proc(n)
        mul(i!,i=1..n) ;
    end proc:
    seq(A000178(n),n=0..10) ; # R. J. Mathar, Oct 30 2015
  • Mathematica
    a[0] := 1; a[1] := 1; a[n_] := n!*a[n - 1]; Table[a[n], {n, 1, 12}] (* Stefan Steinerberger, Mar 10 2006 *)
    Table[BarnesG[n], {n, 2, 14}] (* Zerinvary Lajos, Jul 16 2009 *)
    FoldList[Times,1,Range[20]!] (* Harvey P. Dale, Mar 25 2011 *)
    RecurrenceTable[{a[n] == n! a[n - 1], a[0] == 1}, a, {n, 0, 12}] (* Ray Chandler, Jul 30 2015 *)
    BarnesG[Range[2, 20]] (* Eric W. Weisstein, Jul 14 2017 *)
  • Maxima
    A000178(n):=prod(k!,k,0,n)$ makelist(A000178(n),n,0,30); /* Martin Ettl, Oct 23 2012 */
    
  • PARI
    A000178(n)=prod(k=2,n,k!) \\ M. F. Hasler, Sep 02 2007
    
  • PARI
    a(n)=polcoeff(1-sum(k=0, n-1, a(k)*x^k/prod(j=1, k+1, (1+j!*x+x*O(x^n)) )), n) \\ Paul D. Hanna, Oct 02 2013
    
  • PARI
    for(j=1,13, print1(prod(k=1,j,k^(j-k)),", ")) \\ Hugo Pfoertner, Apr 09 2020
    
  • Python
    A000178_list, n, m = [1], 1,1
    for i in range(1,100):
        m *= i
        n *= m
        A000178_list.append(n) # Chai Wah Wu, Aug 21 2015
    
  • Python
    from math import prod
    def A000178(n): return prod(i**(n-i+1) for i in range(2,n+1)) # Chai Wah Wu, Nov 26 2023
  • Ruby
    def mono_choices(a,b,n)
        n - [a,b].max
    end
    def comm_mono_choices(n)
        accum =1
        0.upto(n-1) do |i|
            i.upto(n-1) do |j|
                accum = accum * mono_choices(i,j,n)
            end
        end
        accum
    end
    1.upto(12) do |k|
        puts comm_mono_choices(k)
    end # Chad Brewbaker, Nov 03 2013
    

Formula

a(0) = 1, a(n) = n!*a(n-1). - Lee Hae-hwang, May 13 2003, corrected by Ilya Gutkovskiy, Jul 30 2016
a(0) = 1, a(n) = 1^n * 2^(n-1) * 3^(n-2) * ... * n = Product_{r=1..n} r^(n-r+1). - Amarnath Murthy, Dec 12 2003 [Formula corrected by Derek Orr, Jul 27 2014]
a(n) = sqrt(A055209(n)). - Philippe Deléham, Mar 07 2004
a(n) = Product_{i=1..n} Product_{j=0..i-1} (i-j). - Paul Barry, Aug 02 2008
log a(n) = 0.5*n^2*log n - 0.75*n^2 + O(n*log n). - Charles R Greathouse IV, Jan 13 2012
Asymptotic: a(n) ~ exp(zeta'(-1) - 3/4 - (3/4)*n^2 - (3/2)*n)*(2*Pi)^(1/2 + (1/2)*n)*(n+1)^((1/2)*n^2 + n + 5/12). For example, a(100) is approx. 0.270317...*10^6941. (See A213080.) - Peter Luschny, Jun 23 2012
G.f.: 1 + x/(U(0) - x) where U(k) = 1 + x*(k+1)! - x*(k+2)!/U(k+1); (continued fraction). - Sergei N. Gladkovskii, Oct 02 2012
G.f.: G(0)/2, where G(k) = 1 + 1/(1 - 1/(1 + 1/((k+1)!*x*G(k+1)))); (continued fraction). - Sergei N. Gladkovskii, Jun 14 2013
G.f.: 1 = Sum_{n>=0} a(n)*x^n / Product_{k=1..n+1} (1 + k!*x). - Paul D. Hanna, Oct 02 2013
A203227(n+1)/a(n) -> e, as n -> oo. - Daniel Suteu, Jul 30 2016
From Ilya Gutkovskiy, Jul 30 2016: (Start)
a(n) = G(n+2), where G(n) is the Barnes G-function.
a(n) ~ exp(1/12 - n*(3*n+4)/4)*n^(n*(n+2)/2 + 5/12)*(2*Pi)^((n+1)/2)/A, where A is the Glaisher-Kinkelin constant (A074962).
Sum_{n>=0} (-1)^n/a(n) = A137986. (End)
0 = a(n)*a(n+2)^3 + a(n+1)^2*a(n+2)^2 - a(n+1)^3*a(n+3) for all n in Z (if a(-1)=1). - Michael Somos, Mar 11 2020
Sum_{n>=0} 1/a(n) = A287013 = 1/A137987. - Amiram Eldar, Nov 19 2020
a(n) = Wronskian(1, x, x^2, ..., x^n). - Mohammed Yaseen, Aug 01 2023
From Andrea Pinos, Apr 04 2024: (Start)
a(n) = e^(Sum_{k=1..n} (Integral_{x=1..k+1} Psi(x) dx)).
a(n) = e^(Integral_{x=1..n+1} (log(sqrt(2*Pi)) - (x-1/2) + x*Psi(x)) dx).
a(n) = e^(Integral_{x=1..n+1} (log(sqrt(2*Pi)) - (x-1/2) + (n+1)*Psi(x) - log(Gamma(x))) dx).
Psi(x) is the digamma function. (End)

A035008 Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.

Original entry on oeis.org

0, 16, 48, 96, 160, 240, 336, 448, 576, 720, 880, 1056, 1248, 1456, 1680, 1920, 2176, 2448, 2736, 3040, 3360, 3696, 4048, 4416, 4800, 5200, 5616, 6048, 6496, 6960, 7440, 7936, 8448, 8976, 9520, 10080, 10656, 11248, 11856, 12480, 13120, 13776
Offset: 0

Views

Author

Ulrich Schimke (ulrschimke(AT)aol.com), Dec 11 1999

Keywords

Comments

16 times the triangular numbers A000217.
Centered 16-gonal numbers A069129, minus 1. Also, sequence found by reading the segment (0, 16) together with the line from 16, in the direction 16, 48, ..., in the square spiral whose vertices are the triangular numbers A000217. - Omar E. Pol, Apr 26 2008, Nov 20 2008
For n >= 1, number of permutations of n+1 objects selected from 5 objects v, w, x, y, z with repetition allowed, containing n-1 v's. Examples: at n=1, n-1=0 (i.e., zero v's), and a(1)=16 because we have ww, wx, wy, wz, xw, xx, xy, xz, yw, yx, yy, yz, zw, zx, zy, zz; at n=2, n-1=1 (i.e., one v), and there are 3 permutations corresponding to each one in the n=1 case (e.g., the single v can be inserted in any of three places in the 2-object permutation xy, yielding vxy, xvy, and xyv), so a(2) = 3*a(1) = 3*16 = 48; at n=3, n-1=2 (i.e., two v's), and a(3) = C(4,2)*a(1) = 6*16 = 96; etc. - Zerinvary Lajos, Aug 07 2008 (this needs clarification, Joerg Arndt, Feb 23 2014)
Sequence found by reading the line from 0, in the direction 0, 16, ... and the same line from 0, in the direction 0, 48, ..., in the square spiral whose vertices are the generalized 18-gonal numbers. - Omar E. Pol, Oct 03 2011
For n > 0, a(n) is the area of the triangle with vertices at ((n-1)^2, n^2), ((n+1)^2, (n+2)^2), and ((n+3)^2, (n+2)^2). - J. M. Bergot, May 22 2014
For n > 0, a(n) is the number of self-intersecting points in star polygon {4*(n+1)/(2*n+1)}. - Bui Quang Tuan, Mar 28 2015
Equivalently: integers k such that k$ / (k/2)! and k$ / (k/2+1)! are both squares when A000178 (k) = k$ = 1!*2!*...*k! is the superfactorial of k (see A348692 for further information). - Bernard Schott, Dec 02 2021

Examples

			3 X 3-Board: knight can be placed in 8 positions with 2 moves from each, so a(1) = 16.
		

Crossrefs

Cf. A033586 (King), A035005 (Queen), A035006 (Rook), A002492 (Bishop) and A049450 (Pawn).
Cf. A348692.
Subsequence of A008586 and of A349081.

Programs

Formula

a(n) = 8*n*(n+1).
G.f.: 16*x/(1-x)^3.
a(n) = A069129(n+1) - 1. - Omar E. Pol, Apr 26 2008
a(n) = binomial(n+1,2)*4^2, n >= 0. - Zerinvary Lajos, Aug 07 2008
a(n) = 8*n^2 + 8*n = 16*A000217(n) = 8*A002378(n) = 4*A046092(n) = 2*A033996(n). - Omar E. Pol, Dec 12 2008
a(n) = a(n-1) + 16*n, with a(0)=0. - Vincenzo Librandi, Nov 17 2010
E.g.f.: 8*exp(x)*x*(2 + x). - Stefano Spezia, May 19 2021
From Amiram Eldar, Feb 22 2023: (Start)
Sum_{n>=1} 1/a(n) = 1/8.
Sum_{n>=1} (-1)^(n+1)/a(n) = (2*log(2) - 1)/8.
Product_{n>=1} (1 - 1/a(n)) = -(8/Pi)*cos(sqrt(3/2)*Pi/2).
Product_{n>=1} (1 + 1/a(n)) = (8/Pi)*cos(Pi/(2*sqrt(2))). (End)

Extensions

More terms from Erich Friedman
Minor errors corrected and edited by Johannes W. Meijer, Feb 04 2010

A139098 a(n) = 8*n^2.

Original entry on oeis.org

0, 8, 32, 72, 128, 200, 288, 392, 512, 648, 800, 968, 1152, 1352, 1568, 1800, 2048, 2312, 2592, 2888, 3200, 3528, 3872, 4232, 4608, 5000, 5408, 5832, 6272, 6728, 7200, 7688, 8192, 8712, 9248, 9800, 10368, 10952, 11552, 12168, 12800, 13448, 14112, 14792, 15488, 16200
Offset: 0

Views

Author

Omar E. Pol, Apr 25 2008

Keywords

Comments

Opposite numbers to the centered 16-gonal numbers (A069129) in the square spiral whose vertices are the triangular numbers (A000217).
8 times the squares. - Omar E. Pol, Dec 09 2008
a(n-1) is the molecular topological index of the n-wheel graph W_n. - Eric W. Weisstein, Jul 11 2011
An n X n pandiagonal magic square has a(n) orientations. - Kausthub Gudipati, Sep 15 2011
Area of a square with diagonal 4n. - Wesley Ivan Hurt, Jun 19 2014
Sum of all the parts in the partitions of 4n into exactly two parts. - Wesley Ivan Hurt, Jul 23 2014
Equivalently: integers k such that k$ / (k/2-1)! and k$ / (k/2)! are both squares when A000178 (k) = k$ = 1!*2!*...*k! is the superfactorial of k (see A348692 for further information). - Bernard Schott, Dec 02 2021

Crossrefs

Programs

Formula

a(n) = 8*A000290(n) = 4*A001105(n) = 2*A016742(n). - Omar E. Pol, Dec 13 2008
G.f.: -8*x*(1+x)/(x-1)^3. - R. J. Mathar, Nov 27 2015
From Amiram Eldar, Feb 03 2021: (Start)
Sum_{n>=1} 1/a(n) = Pi^2/48 (A245058).
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/96.
Product_{n>=1} (1 + 1/a(n)) = sqrt(8)*sinh(Pi/sqrt(8))/Pi.
Product_{n>=1} (1 - 1/a(n)) = sqrt(8)*sin(Pi/sqrt(8))/Pi. (End)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Wesley Ivan Hurt, Dec 03 2021
From Elmo R. Oliveira, Dec 01 2024: (Start)
E.g.f.: 8*x*(1 + x)*exp(x).
a(n) = n*A008590(n) = A001105(2*n). (End)

A060626 Number of right triangles of a given area required to form successively larger squares.

Original entry on oeis.org

2, 14, 34, 62, 98, 142, 194, 254, 322, 398, 482, 574, 674, 782, 898, 1022, 1154, 1294, 1442, 1598, 1762, 1934, 2114, 2302, 2498, 2702, 2914, 3134, 3362, 3598, 3842, 4094, 4354, 4622, 4898, 5182, 5474, 5774, 6082, 6398, 6722, 7054, 7394, 7742, 8098, 8462, 8834, 9214
Offset: 0

Views

Author

Jason Earls, Apr 13 2001

Keywords

Comments

a(n) = number of row of Pascal's triangle in which three consecutive entries appear in the ratio n : n+1 : n+2 (valid for n = 0 if you consider a position of -1 to have value 0). E.g., entries in the ratio 1:2:3 appear in row 14 (1001, 2002, 3003); entries in the ratio 2:3:4 appear in row 34 (927983760, 1391975640, 1855967520); and so on. (The position within the row is given by A091823). - Howard A. Landman, Mar 08 2004
a(n)*(a(n)+1) is an oblong number (Cf. A002378) with the property that the product with the oblong numbers n*(n+1) or (n+1)*(n+2) both are again oblong numbers. Example: For n=3 we have (62*63)*(3*4) = 216*217 and (62*63)*(4*5) = 279*280. - Herbert Kociemba, Apr 13 2008
For n > 0, Hermite polynomial H_2(n) = 4*n^2 - 2. - Vincenzo Librandi, Aug 07 2010
The identity (4*n^2-2)^2 - (n^2-1)*(4*n)^2 = 4 can be written as a(n+1)^2 - A132411(n+2)*A008586(n+2)^2 = 4. - Vincenzo Librandi, Jun 16 2014
Equivalently: positive integers k congruent to 2 mod 4 (A016825) such that k$ / (k/2+1)! is a square when A000178 (k) = k$ = 1!*2!*...*k! is the superfactorial of k (see A348692, A349496 and A349766 for further information). Integers k multiple of 4 such that that k$ / (k/2+1)! is a square are in A035008. - Bernard Schott, Dec 05 2021

Crossrefs

Twice Column 2 of array A188644.
Subsequence of A016825.
Equals disjoint union of A349496 and A349766.

Programs

  • Maple
    for n from 0 to 80 do printf(`%d,`,4*n^2+8*n+2) od:
  • Mathematica
    Table[4*n*(n + 2) + 2, {n, 0, 100}] (* Paolo Xausa, Aug 08 2024 *)
  • PARI
    a(n) = { 4*n^2 + 8*n + 2 } \\ Harry J. Smith, Jul 08 2009

Formula

a(n) = 4*n^2 + 8*n + 2.
a(n) = 8*n + a(n-1) + 4 with n > 0, a(0)=2. - Vincenzo Librandi, Aug 07 2010
G.f.: 2*(1 + 4*x - x^2)/(1-x)^3. - Colin Barker, Jun 28 2012
a(n) = 4*(n+1)^2 - 2 = 2*A056220(n+1). - Bruce J. Nicholson, Aug 31 2017
a(n) + a(n-1) + (n-1)^2 = (3*n + 1)^2 = A016777(n)^2. - Ezhilarasu Velayutham, May 23 2019
From Elmo R. Oliveira, Oct 31 2024: (Start)
E.g.f.: 2*exp(x)*(1 + 6*x + 2*x^2).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

Extensions

More terms from James Sellers, Apr 14 2001

A349079 Numbers k such that there exists m, 1 <= m <= k with the property that A000178(k) / m! is a square, where A000178(k) = k$ = 1!*2!*...*k! is the superfactorial of k.

Original entry on oeis.org

1, 2, 4, 8, 12, 14, 16, 18, 20, 24, 28, 32, 34, 36, 40, 44, 48, 52, 56, 60, 62, 64, 68, 72, 76, 80, 84, 88, 92, 96, 98, 100, 104, 108, 112, 116, 120, 124, 128, 132, 136, 140, 142, 144, 148, 152, 156, 160, 164, 168, 172, 176, 180, 184, 188, 192, 194, 196, 200, 204, 208, 212, 216, 220, 224, 228
Offset: 1

Views

Author

Bernard Schott, Nov 07 2021

Keywords

Comments

If k is a term, then A348692(k) lists integers m such that k$ / m! is a square; and for each k, there exist only one (A349080) or two (A349081) such integers m.
See A348692 for further information, links and references about Olympiads.
Except for 1, all terms are even, and, when k is such an even term, corresponding m belong(s) to {k/2 - 2, k/2 - 1, k/2, k/2 + 1, k/2 + 2}.
This sequence is the union of {1} and of three infinite and disjoint subsequences:
-> A008586, so every positive multiple of 4 is a term and in this case, for k=4*q, (k$)/(k/2)! = ( 2^(k/4) * Product_{j=1..k/2} ((2j-1)!) )^2 (see example 4).
-> A060626, so every k = 4*q^2 - 2 (q >= 1) is a term (see examples 2 and 14).
-> 2*A055792 = {k = 2q^2 with q>1 in A001541} = {18, 578, ...} (see example 18).

Examples

			2 is a term as 2$ / 2! = 1^2.
4 is a term as 4$ / 2! = 12^2.
14 is a term as 14$ / 8! = 1309248519599593818685440000000^2 and also 14$ / 9! = 436416173199864606228480000000^2.
18 is a term as 18$ / 7! = 29230177671473293820176594405114531928195727360000000000000^2.
		

Crossrefs

Programs

  • Mathematica
    supfact[n_] := supfact[n] = BarnesG[n + 2]; fact[n_] := fact[n] = n!; q[k_] := AnyTrue[Range[k], IntegerQ @ Sqrt[supfact[k]/fact[#]] &]; Select[Range[230], q] (* Amiram Eldar, Nov 08 2021 *)
  • PARI
    f(n) = prod(k=2, n, k!); \\ A000178
    isok(k) = my(sf=f(k)); for (m=1, k, if (issquare(sf/m!), return(1))); \\ Michel Marcus, Nov 08 2021

A349080 Numbers k for which there exists only one integer m with 1 <= m <= k such that A000178(k) / m! is a square, where A000178(k) = k$ = 1!*2!*...*k! is the superfactorial of k.

Original entry on oeis.org

1, 2, 4, 12, 18, 20, 24, 28, 34, 36, 40, 44, 52, 56, 60, 62, 64, 68, 76, 80, 84, 88, 92, 98, 100, 104, 108, 112, 116, 120, 124, 132, 136, 140, 142, 144, 148, 152, 156, 164, 168, 172, 176, 180, 184, 188, 192, 194, 196, 204, 208, 212, 216, 220, 224, 228, 232, 236, 244, 248, 252, 254, 256
Offset: 1

Views

Author

Bernard Schott, Nov 20 2021

Keywords

Comments

This sequence is the union of {1} and of three infinite and disjoint subsequences.
-> Numbers k divisible by 4 but not of the form 8q^2 or 8q(q+1) = {4, 12, 20, 24, 28, ...} (see A182834). For these numbers, the corresponding unique m = k/2 (see example for k = 4).
-> Even numbers k not divisible by 4 and of the form k = 2*A055792 = 2*q^2, q>1 in A001541 = {18, 578, ...}. For these numbers, the corresponding unique m = k/2 - 2 = q^2-2 (see example for k = 18)
-> Even numbers k not divisible by 4, that are in A060626 but not of the form k=2q^2-4 with q>1 in A001541 = {2, 34, 62, 98, 142, 194, ...} (A349496). For these numbers, the corresponding unique m = k/2 + 1 (see example for k = 2).
See A348692 for further information.

Examples

			For k = 2, 2$ / 2! = 1^2, hence 2 is a term.
For k = 4, 4$ /1! = 288, 4$ / 3! = 48, 4$ / 4! = 12 but for m = 2, 4$ / 2! = 12^2, hence 4 is a term.
For k = 18 and m = 7, we have 18$ / 7! = 29230177671473293820176594405114531928195727360000000000000^2 and there is no other solution m, hence 18 is a term.
		

Crossrefs

Programs

A349081 Numbers k for which there exist two integers m with 1 <= m_1 < m_2 <= k such that A000178(k) / m! is a square, where A000178(k) = k$ = 1!*2!*...*k! is the superfactorial of k.

Original entry on oeis.org

8, 14, 16, 32, 48, 72, 96, 128, 160, 200, 240, 288, 336, 392, 448, 512, 574, 576, 648, 720, 800, 880, 968, 1056, 1152, 1248, 1352, 1456, 1568, 1680, 1800, 1920, 2048, 2176, 2312, 2448, 2592, 2736, 2888, 3040, 3200, 3360, 3528, 3696, 3872, 4048, 4232, 4416, 4608, 4800, 5000
Offset: 1

Views

Author

Bernard Schott, Dec 01 2021

Keywords

Comments

This sequence is the union of three infinite and disjoint subsequences:
-> Numbers k = 8t^2 > 0 (A139098); for these numbers, m_1 = k/2 - 1 = 4t^2-1 < m_2 = k/2 = 4t^2 (see example for k = 8).
-> Numbers k = 8t*(t+1) (A035008); for these numbers, m_1 = k/2 = 4t(t+1) < m_2 = k/2 + 1 = (2t+1)^2 (see example for k = 16).
-> Even numbers of the form 2t^2-4, t>1 in A001541 (A349766); for these numbers, m_1 = k/2 + 1 = t^2 - 1 < m_2 = k/2 + 2 = t^2 (see example for k = 14).
See A348692 for further information.

Examples

			For k = 8, 8$ / 2! is not a square, but m_1 = 3 because 8$ / 3! = 29030400^2 and m_2 = 4 because 8$ / 4! = 14515200^2.
For k = 14, m_1 = 8 because 14$ / 8! = 1309248519599593818685440000000^2 and m_2 = 9 because 14$ / 9! = 436416173199864606228480000000^2.
For k = 16, m_1 = 8 because 16$ / 8! = 6848282921689337839624757371207680000000000^2 and m_2 = 9 because 16$ / 9! = 2282760973896445946541585790402560000000000^2.
		

Crossrefs

Subsequence of A349079.

Programs

  • Mathematica
    Do[j=0;l=1;g=BarnesG[k+2];While[j<2&&l<=k,If[IntegerQ@Sqrt[g/l!],j++];l++];If[j==2,Print@k],{k,5000}] (* Giorgos Kalogeropoulos, Dec 02 2021 *)
  • PARI
    sf(n) = prod(k=2, n, k!); \\ A000178
    isok(m) = if (!(m%2), my(s=sf(m)); #select(issquare, vector(4, k, s/(m/2+k-2)!), 1) == 2); \\ Michel Marcus, Dec 04 2021

A349496 Numbers of the form 4*t^2-2 (A060626) when t >= 1 is an integer that is not a term in A001542.

Original entry on oeis.org

2, 34, 62, 98, 142, 194, 254, 322, 398, 482, 674, 782, 898, 1022, 1154, 1294, 1442, 1598, 1762, 1934, 2114, 2302, 2498, 2702, 2914, 3134, 3362, 3598, 3842, 4094, 4354, 4622, 4898, 5182, 5474, 5774, 6082, 6398, 6722, 7054, 7394, 7742, 8098, 8462, 8834, 9214, 9602, 9998, 10402
Offset: 1

Views

Author

Bernard Schott, Nov 21 2021

Keywords

Comments

Equivalently: numbers k for which there exists only one integer m with here m = k/2 + 1 such that A000178(k) / m! is a square, where A000178(k) = k$ = 1!*2!*...*k! is the superfactorial of k.

Examples

			A060626(3) = 34 and 3 is not a term in A001542; also 34$ / 18! is a square, hence 34 is a term.
		

Crossrefs

Subsequence of A060626 and of A349080.

Programs

  • PARI
    isok(m) = my(x=(m+2)/4, y); issquare(x, &y) && (denominator(y)==1) && !issquare(2*x+1); \\ Michel Marcus, Nov 22 2021

A349766 Numbers of the form 2*t^2-4 when t > 1 is a term in A001541.

Original entry on oeis.org

14, 574, 19598, 665854, 22619534, 768398398, 26102926094, 886731088894, 30122754096398, 1023286908188734, 34761632124320654, 1180872205318713598, 40114893348711941774, 1362725501650887306814, 46292552162781456489998, 1572584048032918633353214, 53421565080956452077519374
Offset: 1

Views

Author

Bernard Schott, Dec 04 2021

Keywords

Comments

Equivalently: integers k such that k$ / (k/2+1)! and k$ / (k/2+2)! are both squares when A000178 (k) = k$ = 1!*2!*...*k! is the superfactorial of k (see A348692 for further information).
The 3 subsequences of A349081 are A035008, A139098 and this one.

Examples

			A001541(1) = 3, then for t = 3, 2*t^2-4 = 14; also for k = 14, 14$ / 8! = 1309248519599593818685440000000^2 and 14$ / 9! = 436416173199864606228480000000^2. Hence, 14 is a term.
		

Crossrefs

Programs

  • Maple
    with(orthopoly):
    sequence = (2*T(n,3)^2-4, n=1..20);
  • Mathematica
    (2*#^2 - 4) & /@ LinearRecurrence[{6, -1}, {3, 17}, 17] (* Amiram Eldar, Dec 04 2021 *)
    LinearRecurrence[{35, -35, 1},{14, 574, 19598},17] (* Ray Chandler, Mar 01 2024 *)
  • PARI
    a(n) = my(t=subst(polchebyshev(n), 'x, 3)); 2*t^2-4; \\ Michel Marcus, Dec 04 2021

Formula

a(n) = 2*(cosh(2*n*arcsinh(1)))^2 - 4.
a(n) = 16*A001110(n) - 2. - Hugo Pfoertner, Dec 04 2021
Showing 1-9 of 9 results.