Sequences
392,541 sequences
- Numbers k such that 1 + 4 + 9 + ... + k^2 = 1 + 2 + 3 + ... + m for some m.A053611
Numbers k such that 1 + 4 + 9 + ... + k^2 = 1 + 2 + 3 + ... + m for some m.
- Numbers such that 1+2+3...+a(n) = 1+4+9+...+r^2, for some r.A053612
Numbers such that 1+2+3...+a(n) = 1+4+9+...+r^2, for some r.
- Exceptional primes: there does not exist a consecutive triple of integers such that a(n) (prime) such that each number in the triple is a cubic residue of a(n).A053613
Exceptional primes: there does not exist a consecutive triple of integers such that a(n) (prime) such that each number in the triple is a cubic residue of a(n).
- Numbers that are not the sum of distinct triangular numbers.A053614
Numbers that are not the sum of distinct triangular numbers.
- Pyramidal sequence: distance to nearest product of two consecutive integers (promic or heteromecic numbers).A053615
Pyramidal sequence: distance to nearest product of two consecutive integers (promic or heteromecic numbers).
- Pyramidal sequence: distance to nearest triangular number.A053616
Pyramidal sequence: distance to nearest triangular number.
- Number of permutations of length n which avoid the patterns 1234 and 1324.A053617
Number of permutations of length n which avoid the patterns 1234 and 1324.
- a(n) = ceiling(binomial(n,4)/n).A053618
a(n) = ceiling(binomial(n,4)/n).
- a(n) = round(n/(log(n)-1) - pi(n)).A053619
a(n) = round(n/(log(n)-1) - pi(n)).
- Nearest integer to R(n) = the Riemann prime number formula.A053620
Nearest integer to R(n) = the Riemann prime number formula.
- Nearest integer to n/(log(n)-1).A053621
Nearest integer to n/(log(n)-1).
- a(n) = round( n/log(n) - pi(n) ).A053622
a(n) = round( n/log(n) - pi(n) ).
- Number of distinct non-extendable sequences (x(1),x(2),...,x(k)) such that each x(i) is in {1,2,...,n} and (x(j) AND x(i)) <> x(j) for i=2..k, j=1..i-1.A053623
Number of distinct non-extendable sequences (x(1),x(2),...,x(k)) such that each x(i) is in {1,2,...,n} and (x(j) AND x(i)) <> x(j) for i=2..k, j=1..i-1.
- Highly composite odd numbers: odd numbers where d(n) increases to a record.A053624
Highly composite odd numbers: odd numbers where d(n) increases to a record.
- Product of 6 consecutive integers.A053625
Product of 6 consecutive integers.
- a(n) is the smallest positive integer k such that harmonic mean of n and k is an integer.A053626
a(n) is the smallest positive integer k such that harmonic mean of n and k is an integer.
- Smallest integer which is the harmonic mean of n and an integer.A053627
Smallest integer which is the harmonic mean of n and an integer.
- Smallest integer which is the harmonic mean of A005279(n) and an integer.A053628
Smallest integer which is the harmonic mean of A005279(n) and an integer.
- Smallest integer where the harmonic mean of a(n) and A005279(n) is an integer.A053629
Smallest integer where the harmonic mean of a(n) and A005279(n) is an integer.
- Pythagorean spiral: a(n-1), a(n)-1 and a(n) are sides of a right triangle.A053630
Pythagorean spiral: a(n-1), a(n)-1 and a(n) are sides of a right triangle.
- Pythagorean spiral: a(n-1)+1, a(n) and a(n)+1 are the sides of a right triangle (a primitive Pythagorean triangle).A053631
Pythagorean spiral: a(n-1)+1, a(n) and a(n)+1 are the sides of a right triangle (a primitive Pythagorean triangle).
- Irregular triangle read by rows giving coefficients in expansion of Product_{k=1..n} (1 + x^k).A053632
Irregular triangle read by rows giving coefficients in expansion of Product_{k=1..n} (1 + x^k).
- Triangular array T(n,k) giving coefficients in expansion of Product_{j=1..n} (1+x^j) mod x^(n+1)-1.A053633
Triangular array T(n,k) giving coefficients in expansion of Product_{j=1..n} (1+x^j) mod x^(n+1)-1.
- a(n) = Sum_{ d divides n } phi(d)*2^(n/d)/(2n).A053634
a(n) = Sum_{ d divides n } phi(d)*2^(n/d)/(2n).
- a(n) = Sum_{d|n} phi(d)*2^(n/d).A053635
a(n) = Sum_{d|n} phi(d)*2^(n/d).
- a(n) = Sum_{odd d|n} phi(d)*2^(n/d).A053636
a(n) = Sum_{odd d|n} phi(d)*2^(n/d).
- a(n) = ceiling(2^(n-1)/n).A053637
a(n) = ceiling(2^(n-1)/n).
- a(n) = ceiling(2^n/n).A053638
a(n) = ceiling(2^n/n).
- a(n) = ceiling(2^(n+1)/n).A053639
a(n) = ceiling(2^(n+1)/n).
- Number of divisors of highly composite odd numbers (A053624).A053640
Number of divisors of highly composite odd numbers (A053624).
- Rotate n one binary digit to the right, drop leading zeros, then rotate one binary digit to the left.A053641
Rotate n one binary digit to the right, drop leading zeros, then rotate one binary digit to the left.
- Rotate n one binary digit to the left, drop leading zeros, then rotate one binary digit to the right.A053642
Rotate n one binary digit to the left, drop leading zeros, then rotate one binary digit to the right.
- a(n) = ceiling(binomial(n,6)/n).A053643
a(n) = ceiling(binomial(n,6)/n).
- Most significant bit of n, msb(n); largest power of 2 less than or equal to n; write n in binary and change all but the first digit to zero.A053644
Most significant bit of n, msb(n); largest power of 2 less than or equal to n; write n in binary and change all but the first digit to zero.
- Distance to largest power of 2 less than or equal to n; write n in binary, change the first digit to zero, and convert back to decimal.A053645
Distance to largest power of 2 less than or equal to n; write n in binary, change the first digit to zero, and convert back to decimal.
- Distance to nearest power of 2.A053646
Distance to nearest power of 2.
- First term of first sequence of n primes in arithmetic progression with a common difference equal to the product of first n primes.A053647
First term of first sequence of n primes in arithmetic progression with a common difference equal to the product of first n primes.
- Scan decimal expansion of Mersenne primes (A000668), recording all primes seen.A053648
Scan decimal expansion of Mersenne primes (A000668), recording all primes seen.
- Start with the prime 11; next prime must exceed previous prime, contain no 0's and start with last digit of previous prime.A053649
Start with the prime 11; next prime must exceed previous prime, contain no 0's and start with last digit of previous prime.
- Cototient function of n^2.A053650
Cototient function of n^2.
- Number of nonisomorphic cyclic subgroups of general linear group GL(n,2).A053651
Number of nonisomorphic cyclic subgroups of general linear group GL(n,2).
- Primes for which some rearrangement of the digits (leading zeros not allowed) is the product of two consecutive primes.A053652
Primes for which some rearrangement of the digits (leading zeros not allowed) is the product of two consecutive primes.
- Number of ways to rearrange digits of prime(n)*prime(n+1) to form a prime.A053653
Number of ways to rearrange digits of prime(n)*prime(n+1) to form a prime.
- Multiples of 123456789.A053654
Multiples of 123456789.
- a(n) = (10^n - 1)*(10^(2*n-1) - 1)/81.A053655
a(n) = (10^n - 1)*(10^(2*n-1) - 1)/81.
- Number of cyclic graphs with oriented edges on n nodes (up to symmetry of dihedral group).A053656
Number of cyclic graphs with oriented edges on n nodes (up to symmetry of dihedral group).
- a(n) = Product_{p prime} p^{ Sum_{k>=0} floor[(n-1)/((p-1)p^k)]}.A053657
a(n) = Product_{p prime} p^{ Sum_{k>=0} floor[(n-1)/((p-1)p^k)]}.
- Number of nonisomorphic cyclic subgroups of general linear group GL(n,3).A053658
Number of nonisomorphic cyclic subgroups of general linear group GL(n,3).
- Positions where 0 occurs in decimal expansion of e (starting count at decimal point).A053659
Positions where 0 occurs in decimal expansion of e (starting count at decimal point).
- Number of nonisomorphic cyclic subgroups of general linear group GL(n,4).A053660
Number of nonisomorphic cyclic subgroups of general linear group GL(n,4).