Sequences
392,541 sequences
- Maximal number of 132 patterns in a permutation of 1,2,...,n.A061061
Maximal number of 132 patterns in a permutation of 1,2,...,n.
- Sum of squared factorials: (0!)^2 + (1!)^2 + (2!)^2 + (3!)^2 +...+ (n!)^2.A061062
Sum of squared factorials: (0!)^2 + (1!)^2 + (2!)^2 + (3!)^2 +...+ (n!)^2.
- a(n) = 2^(2^n)*3^(2^n) - 2^(2^n) - 3^(2^n).A061063
a(n) = 2^(2^n)*3^(2^n) - 2^(2^n) - 3^(2^n).
- Maximal number of zeros in the character table of a group with n elements.A061064
Maximal number of zeros in the character table of a group with n elements.
- For n <= 6, entry of maximal modulus in the inverse of the n-th Hilbert matrix. For n >= 3, this is the (n-1,n-1)-th entry.A061065
For n <= 6, entry of maximal modulus in the inverse of the n-th Hilbert matrix. For n >= 3, this is the (n-1,n-1)-th entry.
- a(n) = (prime(n)^2 - 1)/8.A061066
a(n) = (prime(n)^2 - 1)/8.
- m-th prime prime(m) is included iff prime(m) + m is also prime.A061067
m-th prime prime(m) is included iff prime(m) + m is also prime.
- Primes which are the sum of a prime and its subscript.A061068
Primes which are the sum of a prime and its subscript.
- Number of distinct values in the list of divisor-sums {sigma(j) : j=1...n}.A061069
Number of distinct values in the list of divisor-sums {sigma(j) : j=1...n}.
- Number of distinct values in the list of values of the Euler totient function {phi(j) : j=1..n}.A061070
Number of distinct values in the list of values of the Euler totient function {phi(j) : j=1..n}.
- Number of distinct values in the list of number of divisors, d(j), j=1...n.A061071
Number of distinct values in the list of number of divisors, d(j), j=1...n.
- Smallest integer with A002191(n) divisors, i.e., the number of divisors equals the sum of the divisors of a different number.A061072
Smallest integer with A002191(n) divisors, i.e., the number of divisors equals the sum of the divisors of a different number.
- First occurrence of n consecutive n's in the decimal expansion of Pi.A061073
First occurrence of n consecutive n's in the decimal expansion of Pi.
- Smallest number that begins with 1, has digits in order 123...901... and is divisible by n. If no such number exists then a(n) = 0.A061074
Smallest number that begins with 1, has digits in order 123...901... and is divisible by n. If no such number exists then a(n) = 0.
- Greatest prime number p(n) with decimal fraction period of length n.A061075
Greatest prime number p(n) with decimal fraction period of length n.
- a(n) is the sum of the products of the digits of all the numbers from 1 to n.A061076
a(n) is the sum of the products of the digits of all the numbers from 1 to n.
- a(n) is the sum of the products of the digits of the first n odd numbers.A061077
a(n) is the sum of the products of the digits of the first n odd numbers.
- Sum of the products of the digits of the first n positive even numbers.A061078
Sum of the products of the digits of the first n positive even numbers.
- Denominators in the series for sin integral Si(x).A061079
Denominators in the series for sin integral Si(x).
- Another erroneous version of A009287.A061080
Another erroneous version of A009287.
- Duplicate of A007368.A061081
Duplicate of A007368.
- a(n) = A053061(n)/n.A061082
a(n) = A053061(n)/n.
- Fibonacci-type sequence based on division: a(0) = 1, a(1) = 2 and a(n) = a(n-2)/a(n-1) but ignore decimal point.A061083
Fibonacci-type sequence based on division: a(0) = 1, a(1) = 2 and a(n) = a(n-2)/a(n-1) but ignore decimal point.
- Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1).A061084
Fibonacci-type sequence based on subtraction: a(0) = 1, a(1) = 2 and a(n) = a(n-2) - a(n-1).
- a(n) = A019550(n) / 3.A061085
a(n) = A019550(n) / 3.
- a(n) is the concatenation of n with n^3.A061086
a(n) is the concatenation of n with n^3.
- a(n) = A061086(n) / n.A061087
a(n) = A061086(n) / n.
- a(n) = A053062(n) / n.A061088
a(n) = A053062(n) / n.
- Duplicate of A067499.A061089
Duplicate of A067499.
- Squares the sum of the squares of whose digits are squares.A061090
Squares the sum of the squares of whose digits are squares.
- Number of k with 1 <= k <= n relatively prime to phi(k).A061091
Number of k with 1 <= k <= n relatively prime to phi(k).
- a(0) = 1; for n>0, a(n) = smallest prime of the form k*a(n-1) + 1.A061092
a(0) = 1; for n>0, a(n) = smallest prime of the form k*a(n-1) + 1.
- Duplicate of A067178.A061093
Duplicate of A067178.
- The alternating group A_n contains an element x which is not conjugate to its inverse (equivalently not all the entries in the character table of A_n are real numbers).A061094
The alternating group A_n contains an element x which is not conjugate to its inverse (equivalently not all the entries in the character table of A_n are real numbers).
- Number of ways of dividing n labeled items into labeled boxes with an equal number of items in each box.A061095
Number of ways of dividing n labeled items into labeled boxes with an equal number of items in each box.
- Let k = n-th number that is a possible digit-sum for a cube (A054966); sequence gives smallest cube with digit-sum k.A061096
Let k = n-th number that is a possible digit-sum for a cube (A054966); sequence gives smallest cube with digit-sum k.
- a(n) is the concatenation of the phi(n) numbers between 1 and n that are relatively prime to n.A061097
a(n) is the concatenation of the phi(n) numbers between 1 and n that are relatively prime to n.
- Concatenation of all numbers less than or equal to n other than the phi(n) numbers relatively prime to n.A061098
Concatenation of all numbers less than or equal to n other than the phi(n) numbers relatively prime to n.
- Squares with digital root 1.A061099
Squares with digital root 1.
- Squares with digital root 4.A061100
Squares with digital root 4.
- Squares with digital root 7.A061101
Squares with digital root 7.
- Duplicate of A016779.A061102
Duplicate of A016779.
- Duplicate of A016791.A061103
Duplicate of A016791.
- Smallest number whose sum of digits is n^2.A061104
Smallest number whose sum of digits is n^2.
- Smallest number whose sum of digits is n^3.A061105
Smallest number whose sum of digits is n^3.
- Compute Euler totient function for the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the smallest.A061106
Compute Euler totient function for the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the smallest.
- a(0) = 0, a(1) = 1, a(n) is the concatenation of a(n-2) and a(n-1) for n > 1.A061107
a(0) = 0, a(1) = 1, a(n) is the concatenation of a(n-2) and a(n-1) for n > 1.
- Compute Euler totient function for the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the largest.A061108
Compute Euler totient function for the prime(n+1)-prime(n)-1 composite numbers between two consecutive primes; choose the largest.
- a(1) = 1; a(n) = smallest number such that the concatenation a(1)a(2)...a(n) is an n-th power.A061109
a(1) = 1; a(n) = smallest number such that the concatenation a(1)a(2)...a(n) is an n-th power.
- a(1) = 1; a(n) = smallest number such that the concatenation a(1)a(2)...a(n) is a square.A061110
a(1) = 1; a(n) = smallest number such that the concatenation a(1)a(2)...a(n) is a square.