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-2 of 2 results.

A329050 Square array A(n,k) = prime(n+1)^(2^k), read by descending antidiagonals (0,0), (0,1), (1,0), (0,2), (1,1), (2,0), ...; Fermi-Dirac primes (A050376) in matrix form, sorted into rows by their prime divisor.

Original entry on oeis.org

2, 4, 3, 16, 9, 5, 256, 81, 25, 7, 65536, 6561, 625, 49, 11, 4294967296, 43046721, 390625, 2401, 121, 13, 18446744073709551616, 1853020188851841, 152587890625, 5764801, 14641, 169, 17, 340282366920938463463374607431768211456, 3433683820292512484657849089281, 23283064365386962890625, 33232930569601, 214358881, 28561, 289, 19
Offset: 0

Views

Author

Antti Karttunen and Peter Munn, Nov 02 2019

Keywords

Comments

This sequence is a permutation of A050376, so every positive integer is the product of a unique subset, S_factors, of its terms. If we restrict S_factors to be chosen from a subset, S_0, consisting of numbers from specified rows and/or columns of this array, there are notable sequences among those that may be generated. See the examples. Other notable sequences can be generated if we restrict the intersection of S_factors with specific rows/columns to have even cardinality. In any of the foregoing cases, the numbers in the resulting sequence form a group under the binary operation A059897(.,.).
Shares with array A246278 the property that columns grow downward by iterating A003961, and indeed, this array can be obtained from A246278 by selecting its columns 1, 2, 8, 128, ..., 2^((2^k)-1), for k >= 0.
A(n,k) is the image of the lattice point with coordinates X=n and Y=k under the inverse of the bijection f defined in the first comment of A306697. This geometric relationship can be used to construct an isomorphism from the polynomial ring GF(2)[x,y] to a ring over the positive integers, using methods similar to those for constructing A297845 and A306697. See A329329, the ring's multiplicative operator, for details.

Examples

			The top left 5 X 5 corner of the array:
  n\k |   0     1       2           3                   4
  ----+-------------------------------------------------------
   0  |   2,    4,     16,        256,              65536, ...
   1  |   3,    9,     81,       6561,           43046721, ...
   2  |   5,   25,    625,     390625,       152587890625, ...
   3  |   7,   49,   2401,    5764801,     33232930569601, ...
   4  |  11,  121,  14641,  214358881,  45949729863572161, ...
Column 0 continues as a list of primes, column 1 as a list of their squares, column 2 as a list of their 4th powers, and so on.
Every nonnegative power of 2 (A000079) is a product of a unique subset of numbers from row 0; every squarefree number (A005117) is a product of a unique subset of numbers from column 0. Likewise other rows and columns generate the sets of numbers from sequences:
Row 1:                 A000244 Powers of 3.
Column 1:              A062503 Squares of squarefree numbers.
Row 2:                 A000351 Powers of 5.
Column 2:              A113849 4th powers of squarefree numbers.
Union of rows 0 and 1:     A003586 3-smooth numbers.
Union of columns 0 and 1:  A046100 Biquadratefree numbers.
Union of row 0 / column 0: A122132 Oddly squarefree numbers.
Row 0 excluding column 0:  A000302 Powers of 4.
Column 0 excluding row 0:  A056911 Squarefree odd numbers.
All rows except 0:         A005408 Odd numbers.
All columns except 0:      A000290\{0} Positive squares.
All rows except 1:         A001651 Numbers not divisible by 3.
All columns except 1:      A252895 (have odd number of square divisors).
If, instead of restrictions on choosing individual factors of the product, we restrict the product to be of an even number of terms from each row of the array, we get A262675. The equivalent restriction applied to columns gives us A268390; applied only to column 0, we get A028260 (product of an even number of primes).
		

Crossrefs

Transpose: A329049.
Permutation of A050376.
Rows 1-4: A001146, A011764, A176594, A165425 (after the two initial terms).
Antidiagonal products: A191555.
Subtable of A182944, A242378, A246278, A329332.
A000290, A003961, A225546 are used to express relationship between terms of this sequence.
Related binary operations: A059897, A306697, A329329.
See also the table in the example section.

Programs

  • Mathematica
    Table[Prime[#]^(2^k) &[m - k + 1], {m, 0, 7}, {k, m, 0, -1}] // Flatten (* Michael De Vlieger, Dec 28 2019 *)
  • PARI
    up_to = 105;
    A329050sq(n,k) = (prime(1+n)^(2^k));
    A329050list(up_to) = { my(v = vector(up_to), i=0); for(a=0, oo, for(col=0, a, i++; if(i > up_to, return(v)); v[i] = A329050sq(col, a-col))); (v); };
    v329050 = A329050list(up_to);
    A329050(n) = v329050[1+n];
    for(n=0,up_to-1,print1(A329050(n),", ")); \\ Antti Karttunen, Nov 06 2019

Formula

A(0,k) = 2^(2^k), and for n > 0, A(n,k) = A003961(A(n-1,k)).
A(n,k) = A182944(n+1,2^k).
A(n,k) = A329332(2^n,2^k).
A(k,n) = A225546(A(n,k)).
A(n,k+1) = A000290(A(n,k)) = A(n,k)^2.

Extensions

Example annotated for clarity by Peter Munn, Feb 12 2020

A255483 Infinite square array read by antidiagonals downwards: T(0,m) = prime(m), m >= 1; for n >= 1, T(n,m) = T(n-1,m)*T(n-1,m+1)/gcd(T(n-1,m), T(n-1,m+1))^2, m >= 1.

Original entry on oeis.org

2, 3, 6, 5, 15, 10, 7, 35, 21, 210, 11, 77, 55, 1155, 22, 13, 143, 91, 5005, 39, 858, 17, 221, 187, 17017, 85, 3315, 1870, 19, 323, 247, 46189, 133, 11305, 5187, 9699690, 23, 437, 391, 96577, 253, 33649, 21505, 111546435, 46
Offset: 0

Views

Author

N. J. A. Sloane, Feb 28 2015

Keywords

Comments

The first column of the array is given by A123098; subsequent columns are obtained by applying the function A003961, i.e., replacing each prime factor by the next larger prime. - M. F. Hasler, Sep 17 2016
Interpretation with respect to A329329 from Peter Munn, Feb 08 2020: (Start)
With respect to the ring defined by A329329 and A059897, the first row gives powers of 3, the first column gives powers of 6, both in order of increasing exponent, and the body of the table gives their products. A329049 is the equivalent table in which the first column gives powers of 4.
A099884 is the equivalent table for the ring defined by A048720 and A003987. That ring is an image of the polynomial ring GF(2)[x] using a standard representation of the polynomials as integers. A329329 describes a comparable mapping to integers from the related polynomial ring GF(2)[x,y].
Using these mappings, the tables here and in A099884 are matching images: the first row represents powers of x, the first column represents powers of (x+1) and the body of the table gives their products.
Hugo van der Sanden's formula (see formula section) indicates that A019565 provides a mapping from A099884. In the wider terms described above, A019565 is an injective homomorphism between images of the 2 polynomial rings, and maps the image of each GF(2)[x] polynomial to the image of the equivalent GF(2)[x,y] polynomial.
(End)

Examples

			The top left corner of the array, row index 0..5, column index 1..10:
    2,    3,     5,     7,    11,     13,     17,     19,      23,      29
    6,   15,    35,    77,   143,    221,    323,    437,     667,     899
   10,   21,    55,    91,   187,    247,    391,    551,     713,    1073
  210, 1155,  5005, 17017, 46189,  96577, 215441, 392863,  765049, 1363783
   22,   39,    85,   133,   253,    377,    527,    703,     943,    1247
  858, 3315, 11305, 33649, 95381, 198679, 370481, 662929, 1175921, 1816879
		

Crossrefs

First two columns = A123098, A276804.
A kind of generalization of A036262.
Transpose: A276578, terms sorted into ascending order: A276579.
A003987, A048720, A059897, A329049 relate to the A329329 polynomial ring interpretation.

Programs

  • Maple
    T:= proc(n, m) option remember; `if`(n=0, ithprime(m),
          T(n-1, m)*T(n-1, m+1)/igcd(T(n-1, m), T(n-1, m+1))^2)
        end:
    seq(seq(T(n, 1+d-n), n=0..d), d=0..10);  # Alois P. Heinz, Feb 28 2015
  • Mathematica
    T[n_, m_] := T[n, m] = If[n == 0, Prime[m], T[n-1, m]*T[n-1, m+1]/GCD[T[n-1, m], T[n-1, m+1]]^2]; Table[Table[T[n, 1+d-n], {n, 0, d}], {d, 0, 10}] // Flatten (* Jean-François Alcover, Mar 09 2015, after Alois P. Heinz *)
  • PARI
    T=matrix(N=15,N);for(j=1,N,T[1,j]=prime(j));(f(x,y)=x*y/gcd(x,y)^2);for(k=1,N-1,for(j=1,N-k,T[k+1,j]=f(T[k,j],T[k,j+1])));A255483=concat(vector(N,i,vector(i,j,T[j,1+i-j]))) \\ M. F. Hasler, Sep 17 2016
    
  • PARI
    A255483(n,k)=prod(j=0,n,if(bitand(n-j,j),1,prime(j+k))) \\ M. F. Hasler, Sep 18 2016
    
  • Scheme
    (define (A255483 n) (A255483bi (A002262 n) (+ 1 (A025581 n))))
    ;; Then use either an almost standalone version (requiring only A000040):
    (define (A255483bi row col) (if (zero? row) (A000040 col) (let ((a (A255483bi (- row 1) col)) (b (A255483bi (- row 1) (+ col 1)))) (/ (lcm a b) (gcd a b)))))
    ;; Or one based on M. F. Hasler's new recurrence:
    (define (A255483bi row col) (if (= 1 col) (A123098 row) (A003961 (A255483bi row (- col 1)))))
    ;; Antti Karttunen, Sep 18 2016

Formula

T(n,1) = A123098(n), T(n,m+1) = A003961(T(n,m)), for all n >= 0, m >= 1. - M. F. Hasler, Sep 17 2016
T(n,m) = Prod_{k=0..n} prime(k+m)^(!(n-k & k)) where !x is 1 if x=0 and 0 else, and & is binary AND. - M. F. Hasler, Sep 18 2016
From Antti Karttunen, Sep 18 2016: (Start)
For n >= 1, m >= 1, T(n,m) = lcm(T(n-1,m),T(n-1,m+1)) / gcd(T(n-1,m),T(n-1,m+1)).
T(n,k) = A007913(A066117(n+1,k)).
T(n,k) = A019565(A099884(n,k-1)) [After Hugo van der Sanden's observations on SeqFan-list].
(End)
From Peter Munn, Jan 08 2020: (Start)
T(0,1) = 2, and for n >= 0, k >= 1, T(n+1,k) = A329329(T(n,k), 6), T(n,k+1) = A329329(T(n,k), 3).
T(n,k) = A329329(T(n,1), T(0,k)).
(End)
Showing 1-2 of 2 results.