Sequences
392,541 sequences
- a(n) = 9^(n^2).A060761
a(n) = 9^(n^2).
- Number of conjugacy classes (the same as the number of irreducible representations) in the dihedral group with 2n elements.A060762
Number of conjugacy classes (the same as the number of irreducible representations) in the dihedral group with 2n elements.
- Number of distinct differences between consecutive divisors (ordered by increasing magnitude) of n which are not also divisors of n.A060763
Number of distinct differences between consecutive divisors (ordered by increasing magnitude) of n which are not also divisors of n.
- Number of divisors of n which are not also differences between consecutive divisors (ordered by increasing magnitude) of n.A060764
Number of divisors of n which are not also differences between consecutive divisors (ordered by increasing magnitude) of n.
- Numbers n such that every difference between consecutive divisors (ordered by increasing magnitude) of n is also a divisor of n.A060765
Numbers n such that every difference between consecutive divisors (ordered by increasing magnitude) of n is also a divisor of n.
- Least common multiple of differences between consecutive divisors of n (ordered by size).A060766
Least common multiple of differences between consecutive divisors of n (ordered by size).
- Erroneous version of A057981.A060767
Erroneous version of A057981.
- Pseudo-Kaprekar triples: q such that if q=x+y+z, then q^3=x*10^i + y*10^j + z, where (y*10^j+z < 10^i) and z < 10^j.A060768
Pseudo-Kaprekar triples: q such that if q=x+y+z, then q^3=x*10^i + y*10^j + z, where (y*10^j+z < 10^i) and z < 10^j.
- "Overdue" primes: upper ends of prime gaps that are larger than the prime number theorem predicts.A060769
"Overdue" primes: upper ends of prime gaps that are larger than the prime number theorem predicts.
- "Early" primes: upper ends of prime gaps that are smaller than the prime number theorem predicts.A060770
"Early" primes: upper ends of prime gaps that are smaller than the prime number theorem predicts.
- Upper ends of record prime gaps under consideration of the prime number theorem.A060771
Upper ends of record prime gaps under consideration of the prime number theorem.
- Minimal Thompson primes: a(n) is the smallest prime expressible as p1*p2*...*pk-q1*q2*...*qj, where k+j=n and {p1,...,qj} are the first n primes.A060772
Minimal Thompson primes: a(n) is the smallest prime expressible as p1*p2*...*pk-q1*q2*...*qj, where k+j=n and {p1,...,qj} are the first n primes.
- Numbers having a unique partition into three nonnegative triangular numbers.A060773
Numbers having a unique partition into three nonnegative triangular numbers.
- a(n) = number of lattice paths from (0,0,0) to (n,n,n) along the cracks on the surface of a Rubik-ized n X n X n cube so that no step increases distance from goal.A060774
a(n) = number of lattice paths from (0,0,0) to (n,n,n) along the cracks on the surface of a Rubik-ized n X n X n cube so that no step increases distance from goal.
- The greatest divisor d|n such that d < n/d, with a(1) = 1.A060775
The greatest divisor d|n such that d < n/d, with a(1) = 1.
- Smaller central (median) divisor of n!.A060776
Smaller central (median) divisor of n!.
- Larger central (or median) divisor of n!.A060777
Larger central (or median) divisor of n!.
- a(n) = gcd(tau(n+1), tau(n)), where tau = A000005.A060778
a(n) = gcd(tau(n+1), tau(n)), where tau = A000005.
- a(n) = lcm(tau(n+1), tau(n)), where tau = A000005.A060779
a(n) = lcm(tau(n+1), tau(n)), where tau = A000005.
- a(n) = gcd(sigma(n+1), sigma(n)), where sigma = A000203.A060780
a(n) = gcd(sigma(n+1), sigma(n)), where sigma = A000203.
- a(n) = lcm(sigma(n+1), sigma(n)), where sigma = A000203.A060781
a(n) = lcm(sigma(n+1), sigma(n)), where sigma = A000203.
- Degree of the curve C(n) relative to a triangle ABC with side lengths a, b and c, given by (x^n- b^n)(y^n-c^n)(z^n-a^n) = (x^n-c^n)(y^n-a^n)(z^n-b^n) where x, y and z denote the distances from the variable point to vertices A, B and C respectively.A060782
Degree of the curve C(n) relative to a triangle ABC with side lengths a, b and c, given by (x^n- b^n)(y^n-c^n)(z^n-a^n) = (x^n-c^n)(y^n-a^n)(z^n-b^n) where x, y and z denote the distances from the variable point to vertices A, B and C respectively.
- Number of conics which pass through 3 points and are bitangent to a general curve of order n.A060783
Number of conics which pass through 3 points and are bitangent to a general curve of order n.
- Number of double tangents of order n.A060784
Number of double tangents of order n.
- a(n) = 3*(n - 2)*(5*n -11).A060785
a(n) = 3*(n - 2)*(5*n -11).
- a(n) = 9*(n-2)*(5*n-13)*(5*n^2 - 19*n + 16)/2.A060786
a(n) = 9*(n-2)*(5*n-13)*(5*n^2 - 19*n + 16)/2.
- a(n) = 18*(n - 2)*(2*n - 5).A060787
a(n) = 18*(n - 2)*(2*n - 5).
- a(n) = 9*(n-2)^2 * (n^2 - 2*n - 1).A060788
a(n) = 9*(n-2)^2 * (n^2 - 2*n - 1).
- a(n) = n / (gcd(n,2) * gcd(n,3)).A060789
a(n) = n / (gcd(n,2) * gcd(n,3)).
- Inscribe two circles of curvature 2 inside a circle of curvature -1. Sequence gives curvatures of the smallest circles that can be sequentially inscribed in such a diagram.A060790
Inscribe two circles of curvature 2 inside a circle of curvature -1. Sequence gives curvatures of the smallest circles that can be sequentially inscribed in such a diagram.
- a(n) = n / gcd(n,5).A060791
a(n) = n / gcd(n,5).
- Numbers that are palindromic in bases 2 and 3.A060792
Numbers that are palindromic in bases 2 and 3.
- Orders of finite perfect groups (groups such that G = G' where G' is the commutator subgroup of G).A060793
Orders of finite perfect groups (groups such that G = G' where G' is the commutator subgroup of G).
- Difference between upper and lower central divisors of n.A060794
Difference between upper and lower central divisors of n.
- Write product of first n primes as x*y with x<y and x maximal; sequence gives value of x.A060795
Write product of first n primes as x*y with x<y and x maximal; sequence gives value of x.
- Upper central divisor of n-th primorial.A060796
Upper central divisor of n-th primorial.
- Integer part of square root of n-th primorial, A002110(n).A060797
Integer part of square root of n-th primorial, A002110(n).
- Numbers k such that difference between the upper and lower central divisors of k is 1.A060798
Numbers k such that difference between the upper and lower central divisors of k is 1.
- Erroneous version of A046017.A060799
Erroneous version of A046017.
- a(n) = p^2 + p + 1 where p runs through the primes.A060800
a(n) = p^2 + p + 1 where p runs through the primes.
- Invert transform of odd numbers: a(n) = Sum_{k=1..n} (2*k+1)*a(n-k), a(0)=1.A060801
Invert transform of odd numbers: a(n) = Sum_{k=1..n} (2*k+1)*a(n-k), a(0)=1.
- To weigh from 1 to n, make the heaviest weight as small as possible, under the condition of using fewest pieces of different, single weights; a(n) = weight of the heaviest weight.A060802
To weigh from 1 to n, make the heaviest weight as small as possible, under the condition of using fewest pieces of different, single weights; a(n) = weight of the heaviest weight.
- a(n) = Sum_{k=0..n} 2^(2^k).A060803
a(n) = Sum_{k=0..n} 2^(2^k).
- Continued fraction for 2*zeta(3).A060804
Continued fraction for 2*zeta(3).
- Numerators of special continued fraction for 2*zeta(3).A060805
Numerators of special continued fraction for 2*zeta(3).
- Denominators of special continued fraction for 2*zeta(3).A060806
Denominators of special continued fraction for 2*zeta(3).
- Numerators of ordinary continued fraction convergents for 2*zeta(3).A060807
Numerators of ordinary continued fraction convergents for 2*zeta(3).
- Denominators of ordinary continued fraction convergents for 2*zeta(3).A060808
Denominators of ordinary continued fraction convergents for 2*zeta(3).
- Erroneous version of A006887.A060809
Erroneous version of A006887.
- Numbers whose squares have their digits in strictly increasing order.A060810
Numbers whose squares have their digits in strictly increasing order.