Sequences
392,541 sequences
- Positive integers k such that 24*k^2 - 23 is a square.A074061
Positive integers k such that 24*k^2 - 23 is a square.
- Reflected (see A074058) pentanacci numbers A074048.A074062
Reflected (see A074058) pentanacci numbers A074048.
- a(n) is the number of essentially different ways in which the integers 1,2,3,...,n can be arranged in a sequence such that (1) adjacent integers sum to a prime number and (2) squares of adjacent numbers sum to a prime number. Rotations and reversals are counted only once.A074063
a(n) is the number of essentially different ways in which the integers 1,2,3,...,n can be arranged in a sequence such that (1) adjacent integers sum to a prime number and (2) squares of adjacent numbers sum to a prime number. Rotations and reversals are counted only once.
- Number of cycle types of degree-n permutations having the maximum possible order.A074064
Number of cycle types of degree-n permutations having the maximum possible order.
- Numerators a(n) of fractions slowly converging to sqrt(3): let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < sqrt(3), then a(n+1) = a(n) + 1, else a(n+1)= a(n).A074065
Numerators a(n) of fractions slowly converging to sqrt(3): let a(1) = 0, b(n) = n - a(n); if (a(n) + 1) / b(n) < sqrt(3), then a(n+1) = a(n) + 1, else a(n+1)= a(n).
- Zigzag modulo 3.A074066
Zigzag modulo 3.
- Zigzag modulo 5.A074067
Zigzag modulo 5.
- Zigzag modulo 7.A074068
Zigzag modulo 7.
- Numbers k such that S(k) = Sum_{i=1..k} A068119(i) = 3*k.A074069
Numbers k such that S(k) = Sum_{i=1..k} A068119(i) = 3*k.
- Number of Paley classes of Hadamard matrices of order 4n.A074070
Number of Paley classes of Hadamard matrices of order 4n.
- Decimal expansion of Thue constant.A074071
Decimal expansion of Thue constant.
- Numerators of iterations of Thue-Morse sequence.A074072
Numerators of iterations of Thue-Morse sequence.
- Denominators of iterations of Thue-Morse sequence.A074073
Denominators of iterations of Thue-Morse sequence.
- The numbers D in the set {D :=(2n+1)^2-4m^2, 1<=m<=n} that generate the smallest solution x to x^2 - D*y^2 = 1.A074074
The numbers D in the set {D :=(2n+1)^2-4m^2, 1<=m<=n} that generate the smallest solution x to x^2 - D*y^2 = 1.
- Values of m corresponding to the minimization problem of A074074.A074075
Values of m corresponding to the minimization problem of A074074.
- One-sixth of the area of some primitive Heronian triangles with a distance of 2n+1 between the median and altitude points on the longest side.A074076
One-sixth of the area of some primitive Heronian triangles with a distance of 2n+1 between the median and altitude points on the longest side.
- a(n) = 3n - Sum_{k=1..n} A068119(n).A074077
a(n) = 3n - Sum_{k=1..n} A068119(n).
- Number of steps to reach an integer starting with s = n/3 and iterating the map x -> s*ceiling(x).A074078
Number of steps to reach an integer starting with s = n/3 and iterating the map x -> s*ceiling(x).
- Square array A(row,col) (listed in order A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), A(0,3), etc.), giving essentially the same information as the triangle A074080 which shows only the upper triangular region.A074079
Square array A(row,col) (listed in order A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), A(2,0), A(0,3), etc.), giving essentially the same information as the triangle A074080 which shows only the upper triangular region.
- Triangle T(n,k) (listed in order T(1,0), T(2,0), T(2,1), T(3,0), T(3,1), T(3,2), T(4,0), etc.) giving the number of 2^k-cycles that occur in the n-th sub-permutation of A069767/A069768 (i.e., in the range [A014137(n-1)..A014138(n-1)] inclusive).A074080
Triangle T(n,k) (listed in order T(1,0), T(2,0), T(2,1), T(3,0), T(3,1), T(3,2), T(4,0), etc.) giving the number of 2^k-cycles that occur in the n-th sub-permutation of A069767/A069768 (i.e., in the range [A014137(n-1)..A014138(n-1)] inclusive).
- Sum of determinants of 3rd-order principal minors of powers of inverse of tetramatrix ((1,1,0,0),(1,0,1,0),(1,0,0,1),(1,0,0,0)).A074081
Sum of determinants of 3rd-order principal minors of powers of inverse of tetramatrix ((1,1,0,0),(1,0,1,0),(1,0,0,1),(1,0,0,0)).
- Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,1).A074082
Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,1).
- Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,1).A074083
Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(1,1).
- Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,1).A074084
Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,1).
- Coefficient of q^2 in nu(n), where nu(0) = 1, nu(1) = b and, for n >= 2, nu(n) = b*nu(n-1) + lambda*(1 + q + q^2 + ... + q^(n - 2))*nu(n-2) with (b,lambda) = (2,1).A074085
Coefficient of q^2 in nu(n), where nu(0) = 1, nu(1) = b and, for n >= 2, nu(n) = b*nu(n-1) + lambda*(1 + q + q^2 + ... + q^(n - 2))*nu(n-2) with (b,lambda) = (2,1).
- Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,1).A074086
Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,1).
- Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,3).A074087
Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,3).
- Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,3).A074088
Coefficient of q^2 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,3).
- Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n >= 2, nu(n) = b*nu(n-1) + lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,3).A074089
Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n >= 2, nu(n) = b*nu(n-1) + lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(2,3).
- Number of steps to reach an integer starting with s = n/4 and iterating the map x -> s*ceiling(x).A074090
Number of steps to reach an integer starting with s = n/4 and iterating the map x -> s*ceiling(x).
- Number of steps to reach an integer starting with s = n/5 and iterating the map x -> s*ceiling(x).A074091
Number of steps to reach an integer starting with s = n/5 and iterating the map x -> s*ceiling(x).
- Number of plane binary trees of size n+3 and contracted height n.A074092
Number of plane binary trees of size n+3 and contracted height n.
- Number of values of k such that n = k - largest divisor of k (<k).A074093
Number of values of k such that n = k - largest divisor of k (<k).
- a(1) = 1; for n > 1, a(n) = LCM of next n composite numbers.A074094
a(1) = 1; for n > 1, a(n) = LCM of next n composite numbers.
- Duplicate of A048692.A074095
Duplicate of A048692.
- Number of steps to reach an integer starting with s = n/7 and iterating the map x -> s*ceiling(x).A074096
Number of steps to reach an integer starting with s = n/7 and iterating the map x -> s*ceiling(x).
- Record values in A074078.A074097
Record values in A074078.
- Where records occur in A074078.A074098
Where records occur in A074078.
- Duplicate of A006788.A074099
Duplicate of A006788.
- Cubes using only digits 1, 2, 3, 5 and 7.A074100
Cubes using only digits 1, 2, 3, 5 and 7.
- Squares using no prime digit.A074101
Squares using no prime digit.
- Cubes from which deleting a suitable digit leaves a square.A074102
Cubes from which deleting a suitable digit leaves a square.
- a(n) = n!/A074859(n).A074103
a(n) = n!/A074859(n).
- Smallest multiple of n such that every partial sum is a prime, or 0 if no such number exists.A074104
Smallest multiple of n such that every partial sum is a prime, or 0 if no such number exists.
- Smallest multiple of the n-th prime such that the n-th partial sum is divisible by n.A074105
Smallest multiple of the n-th prime such that the n-th partial sum is divisible by n.
- a(1)=1; a(n) is the minimal unused odd prime such that the sum a(1)+a(2)+...+a(n) is divisible by n.A074106
a(1)=1; a(n) is the minimal unused odd prime such that the sum a(1)+a(2)+...+a(n) is divisible by n.
- a(n) = Product of (prime + 1) for first n primes - primorial (n); Sum of proper divisors of the n-th primorial.A074107
a(n) = Product of (prime + 1) for first n primes - primorial (n); Sum of proper divisors of the n-th primorial.
- Smallest number such that the concatenation of first n terms is a proper multiple of the concatenation of first n natural numbers.A074108
Smallest number such that the concatenation of first n terms is a proper multiple of the concatenation of first n natural numbers.
- Smallest n-digit squarefree number.A074109
Smallest n-digit squarefree number.
- Largest n-digit squarefree number.A074110
Largest n-digit squarefree number.