Sequences
392,541 sequences
- Square array read by antidiagonals, alternating upwards and downwards: T(1,1) = 2 and every other entry is the smallest prime not already used such that the n-th antidiagonal sum is a multiple of n.A082011
Square array read by antidiagonals, alternating upwards and downwards: T(1,1) = 2 and every other entry is the smallest prime not already used such that the n-th antidiagonal sum is a multiple of n.
- First row of square array A082011.A082012
First row of square array A082011.
- First column of square array A082011.A082013
First column of square array A082011.
- Antidiagonal sums of square array A082011.A082014
Antidiagonal sums of square array A082011.
- Antidiagonal sums of square array A082011 divided by the number of the antidiagonal.A082015
Antidiagonal sums of square array A082011 divided by the number of the antidiagonal.
- Duplicate of A074135.A082016
Duplicate of A074135.
- First row of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.A082017
First row of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.
- First column of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.A082018
First column of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.
- Diagonal of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.A082019
Diagonal of square array T(n,k) with T(1,1) = 1 where antidiagonals are filled alternating upwards and downwards with the smallest number not already used such that the n-th antidiagonal sum is a multiple of n.
- Decimal expansion of 15/Pi^2.A082020
Decimal expansion of 15/Pi^2.
- a(0) = 7; for n > 0, a(n) is the greatest prime factor of PP(PP(a(n-1)))*a(n-1)+2 where PP(n) is an abbreviation for PreviousPrime(n).A082021
a(0) = 7; for n > 0, a(n) is the greatest prime factor of PP(PP(a(n-1)))*a(n-1)+2 where PP(n) is an abbreviation for PreviousPrime(n).
- In the following square array A(i,j) = Least Common Multiple of i and j. Sequence contains the product of the terms of the n-th antidiagonal.A082022
In the following square array A(i,j) = Least Common Multiple of i and j. Sequence contains the product of the terms of the n-th antidiagonal.
- Number of partitions of n into 2 parts which are not relatively prime.A082023
Number of partitions of n into 2 parts which are not relatively prime.
- Number of partitions of n into 3 parts which have common divisors.A082024
Number of partitions of n into 3 parts which have common divisors.
- Square array of distinct positive integers, in which neighboring entries (both orthogonal and diagonal) are coprime. The array is read by antidiagonals, alternating upwards and downwards. Each entry is the smallest positive integer not already used that is coprime to all of the neighboring entries that are earlier in the sequence.A082025
Square array of distinct positive integers, in which neighboring entries (both orthogonal and diagonal) are coprime. The array is read by antidiagonals, alternating upwards and downwards. Each entry is the smallest positive integer not already used that is coprime to all of the neighboring entries that are earlier in the sequence.
- a(1)=5; a(n) is concatenation of squares of digits in a(n-1) (in base 10).A082026
a(1)=5; a(n) is concatenation of squares of digits in a(n-1) (in base 10).
- a(1)=6; a(n) is concatenation of the squares of each digit of a(n-1), in order (in base 10).A082027
a(1)=6; a(n) is concatenation of the squares of each digit of a(n-1), in order (in base 10).
- Expansion of exp(x)*(1+x)/(1-x)^2.A082028
Expansion of exp(x)*(1+x)/(1-x)^2.
- Expansion of exp(2*x)*(1+x)/(1-x)^2.A082029
Expansion of exp(2*x)*(1+x)/(1-x)^2.
- Expansion of e.g.f. exp(x)/(1-x)^3.A082030
Expansion of e.g.f. exp(x)/(1-x)^3.
- Expansion of e.g.f. exp(2*x)/(1-x)^3.A082031
Expansion of e.g.f. exp(2*x)/(1-x)^3.
- Expansion of e.g.f.: exp(2*x)/(1-2*x).A082032
Expansion of e.g.f.: exp(2*x)/(1-2*x).
- a(n) = (3*n + 1)*n!.A082033
a(n) = (3*n + 1)*n!.
- a(n) = (4*n + 1)*n!.A082034
a(n) = (4*n + 1)*n!.
- a(n) = (4n^2+2n+1) * n!.A082035
a(n) = (4n^2+2n+1) * n!.
- a(n) = (9*n^2+3*n+1) * n!.A082036
a(n) = (9*n^2+3*n+1) * n!.
- A square array of linear-factorial numbers, read by antidiagonals.A082037
A square array of linear-factorial numbers, read by antidiagonals.
- A square array of quadratic-factorial numbers, read by antidiagonals.A082038
A square array of quadratic-factorial numbers, read by antidiagonals.
- Symmetric square array defined by T(n,k) = k^2*n^2 + k*n + 1, read by antidiagonals.A082039
Symmetric square array defined by T(n,k) = k^2*n^2 + k*n + 1, read by antidiagonals.
- a(n) = 9*n^2 + 3*n + 1.A082040
a(n) = 9*n^2 + 3*n + 1.
- a(n) = 16*n^2 + 4*n + 1.A082041
a(n) = 16*n^2 + 4*n + 1.
- a(n) = (n^2 + 1)*n!.A082042
a(n) = (n^2 + 1)*n!.
- Square array, A(n, k) = (k*n)^2 + 2*k*n + 1, read by antidiagonals.A082043
Square array, A(n, k) = (k*n)^2 + 2*k*n + 1, read by antidiagonals.
- Main diagonal of A082043: a(n) = n^4 + 2*n^2 + 1.A082044
Main diagonal of A082043: a(n) = n^4 + 2*n^2 + 1.
- Diagonal sums of number array A082043.A082045
Diagonal sums of number array A082043.
- Square array, A(n, k) = (k*n)^2 + 3*k*n + 1, read by antidiagonals.A082046
Square array, A(n, k) = (k*n)^2 + 3*k*n + 1, read by antidiagonals.
- Diagonal sums of number array A082046.A082047
Diagonal sums of number array A082046.
- a(n) = least number greater than n having greater smallest prime factor than that of n.A082048
a(n) = least number greater than n having greater smallest prime factor than that of n.
- Least composite number greater than n-th composite number having greater smallest prime factor than that of n-th composite number.A082049
Least composite number greater than n-th composite number having greater smallest prime factor than that of n-th composite number.
- Sum of divisors of n that are not of the form 3k+1.A082050
Sum of divisors of n that are not of the form 3k+1.
- Sum of divisors of n that are not of the form 3k+2.A082051
Sum of divisors of n that are not of the form 3k+2.
- Sum of divisors of n that are not of the form 4k+1.A082052
Sum of divisors of n that are not of the form 4k+1.
- Sum of divisors of n that are not of the form 4k+3.A082053
Sum of divisors of n that are not of the form 4k+3.
- Sum of common prime divisors (without multiplicity) of sigma(n) and phi(n).A082054
Sum of common prime divisors (without multiplicity) of sigma(n) and phi(n).
- Product of common prime-divisors (without multiplicity) of sigma(n) and phi(n).A082055
Product of common prime-divisors (without multiplicity) of sigma(n) and phi(n).
- Least x = a(n) such that sum of common prime divisors (without multiplicity) of sigma(x) and phi(x) equals n, or 0 if such number (apparently) does not exist.A082056
Least x = a(n) such that sum of common prime divisors (without multiplicity) of sigma(x) and phi(x) equals n, or 0 if such number (apparently) does not exist.
- Least x=a(n) such that product of common prime-divisors [without multiplicity] of sigma(x) and phi(x) equals n; or 0 if n is not a squarefree number or if no such x exists. Among indices n only squarefree numbers arise because multiplicity of prime factors is ignored.A082057
Least x=a(n) such that product of common prime-divisors [without multiplicity] of sigma(x) and phi(x) equals n; or 0 if n is not a squarefree number or if no such x exists. Among indices n only squarefree numbers arise because multiplicity of prime factors is ignored.
- a(n) is the smallest k such that prime(k) contains the digits of n as a substring.A082058
a(n) is the smallest k such that prime(k) contains the digits of n as a substring.
- Numbers k such that k, sigma(k) and phi(k) have the same decimal digits (ignoring multiplicity).A082059
Numbers k such that k, sigma(k) and phi(k) have the same decimal digits (ignoring multiplicity).
- Numbers k such that k and phi(k) have the same distinct decimal digits.A082060
Numbers k such that k and phi(k) have the same distinct decimal digits.