Sequences
392,541 sequences
- Experimental values for number of circles in packing equal circles into a square for which there are no loose circles.A051661
Experimental values for number of circles in packing equal circles into a square for which there are no loose circles.
- House numbers: a(n) = (n+1)^3 + Sum_{i=1..n} i^2.A051662
House numbers: a(n) = (n+1)^3 + Sum_{i=1..n} i^2.
- Primes p such that there is no Carmichael number pqr, p<q<r q, r primes.A051663
Primes p such that there is no Carmichael number pqr, p<q<r q, r primes.
- a(n) is the number of nonzero coefficients in the n-th cyclotomic polynomial.A051664
a(n) is the number of nonzero coefficients in the n-th cyclotomic polynomial.
- Duplicate of A028263.A051665
Duplicate of A028263.
- Rows of triangle formed using Pascal's rule except begin and end n-th row with n^2.A051666
Rows of triangle formed using Pascal's rule except begin and end n-th row with n^2.
- a(n) = 6*2^n - 4*n - 6.A051667
a(n) = 6*2^n - 4*n - 6.
- Rows of triangle formed using Pascal's rule except begin and end n-th row with (n+1)^2.A051668
Rows of triangle formed using Pascal's rule except begin and end n-th row with (n+1)^2.
- a(n) = 11*2^n - 4*n - 10.A051669
a(n) = 11*2^n - 4*n - 10.
- Smallest prime that concatenated with all previous terms of sequence forms a prime.A051670
Smallest prime that concatenated with all previous terms of sequence forms a prime.
- Smallest positive number whose digits concatenated with all previous terms forms a perfect square.A051671
Smallest positive number whose digits concatenated with all previous terms forms a perfect square.
- Triangle of up-down sums of k-th powers: a(n,k)=sum(i^k,i=1..n)+sum((n-i)^k,i=1..n-1), n,k>0.A051672
Triangle of up-down sums of k-th powers: a(n,k)=sum(i^k,i=1..n)+sum((n-i)^k,i=1..n-1), n,k>0.
- Cubic star numbers: a(n) = n^3 + 4*Sum_{i=0..n-1} i^2.A051673
Cubic star numbers: a(n) = n^3 + 4*Sum_{i=0..n-1} i^2.
- a(n) = prime(n)^prime(n).A051674
a(n) = prime(n)^prime(n).
- "Second factorials": Product_{k=1..n} k^(k^2).A051675
"Second factorials": Product_{k=1..n} k^(k^2).
- Composite numbers whose square has a prime number of divisors.A051676
Composite numbers whose square has a prime number of divisors.
- Tetrahedron-tree numbers: a(n)=sum(b(m),m=1..n), b(m)=1, 1,3, 1,3,6, 1,3,6,10,..., 1,2,...,i*(i+1)2.A051677
Tetrahedron-tree numbers: a(n)=sum(b(m),m=1..n), b(m)=1, 1,3, 1,3,6, 1,3,6,10,..., 1,2,...,i*(i+1)2.
- Square-pyramid-tree numbers: a(n) = sum(b(m),m=1..n), b(m) = 1^2, 1^2,2^2, 1^2,2^2,3^2,.. = (A002260)^2.A051678
Square-pyramid-tree numbers: a(n) = sum(b(m),m=1..n), b(m) = 1^2, 1^2,2^2, 1^2,2^2,3^2,.. = (A002260)^2.
- Total number of even entries in first n rows of Pascal's triangle (the zeroth and first rows being 1; 1,1).A051679
Total number of even entries in first n rows of Pascal's triangle (the zeroth and first rows being 1; 1,1).
- Number of n X n invertible matrices A over GF(3) such that A-I is invertible.A051680
Number of n X n invertible matrices A over GF(3) such that A-I is invertible.
- Smallest term of first run of exactly n consecutive integers which are not squarefree.A051681
Smallest term of first run of exactly n consecutive integers which are not squarefree.
- 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n-7)/2.A051682
11-gonal (or hendecagonal) numbers: a(n) = n*(9*n-7)/2.
- Triangle read by rows: T(n,k) = n!*k.A051683
Triangle read by rows: T(n,k) = n!*k.
- Auxiliary sequence for calculation of number of even permutations of degree n and order exactly 2.A051684
Auxiliary sequence for calculation of number of even permutations of degree n and order exactly 2.
- Auxiliary sequence for calculation of number of even permutations of degree n and order exactly 4.A051685
Auxiliary sequence for calculation of number of even permutations of degree n and order exactly 4.
- Smallest prime p such that 2n*p+1 is also prime.A051686
Smallest prime p such that 2n*p+1 is also prime.
- a(n) = (5*n+6)(!^5)/6, related to A008548 ((5*n+1)(!^5) quintic, or 5-factorials).A051687
a(n) = (5*n+6)(!^5)/6, related to A008548 ((5*n+1)(!^5) quintic, or 5-factorials).
- a(n) = (5*n+7)(!^5)/7(!^5), related to A034323 ((5*n+2)(!^5) quintic, or 5-factorials).A051688
a(n) = (5*n+7)(!^5)/7(!^5), related to A034323 ((5*n+2)(!^5) quintic, or 5-factorials).
- a(n) = (5*n+8)(!^5)/8(!^5), related to A034300 ((5*n+3)(!^5) quintic, or 5-factorials).A051689
a(n) = (5*n+8)(!^5)/8(!^5), related to A034300 ((5*n+3)(!^5) quintic, or 5-factorials).
- a(n) = (5*n+9)(!^5)/9(!^5), related to A034301 ((5*n+2)(!^5) quintic, or 5-factorials).A051690
a(n) = (5*n+9)(!^5)/9(!^5), related to A034301 ((5*n+2)(!^5) quintic, or 5-factorials).
- a(n) = (5*n+10)(!^5)/10(!^5), related to A052562 ((5*n)(!^5) quintic, or 5-factorials).A051691
a(n) = (5*n+10)(!^5)/10(!^5), related to A052562 ((5*n)(!^5) quintic, or 5-factorials).
- a(n) is twice the smallest k such that A051686(k) = prime(n).A051692
a(n) is twice the smallest k such that A051686(k) = prime(n).
- Square array read by antidiagonals: a(n,k) = sum of two positive regular n-polytopic numbers (i.e., a(n,k) = binomial(x,n) + binomial(y,n) for some x,y >= n).A051693
Square array read by antidiagonals: a(n,k) = sum of two positive regular n-polytopic numbers (i.e., a(n,k) = binomial(x,n) + binomial(y,n) for some x,y >= n).
- Smallest Fibonacci number that is divisible by n-th prime.A051694
Smallest Fibonacci number that is divisible by n-th prime.
- Number of degree-n even permutations of order exactly 4.A051695
Number of degree-n even permutations of order exactly 4.
- Greatest common divisor of n! and n^n.A051696
Greatest common divisor of n! and n^n.
- Closest prime to n (break ties by taking the smaller prime).A051697
Closest prime to n (break ties by taking the smaller prime).
- Closest prime to n that is different from n (break ties by taking the smaller prime).A051698
Closest prime to n that is different from n (break ties by taking the smaller prime).
- Distance from n to closest prime.A051699
Distance from n to closest prime.
- Distance from n to closest prime that is different from n.A051700
Distance from n to closest prime that is different from n.
- Closest prime to n-th prime p that is different from p (break ties by taking the smaller prime).A051701
Closest prime to n-th prime p that is different from p (break ties by taking the smaller prime).
- Distance from n-th prime to closest prime.A051702
Distance from n-th prime to closest prime.
- Maximal value of products of partitions of n into powers of distinct primes (1 not considered a power).A051703
Maximal value of products of partitions of n into powers of distinct primes (1 not considered a power).
- Maximal value of products of partitions of n into powers of distinct primes (powers of 1 and 2 excluded).A051704
Maximal value of products of partitions of n into powers of distinct primes (powers of 1 and 2 excluded).
- Numbers whose Japanese name lacks syllable "ku".A051705
Numbers whose Japanese name lacks syllable "ku".
- Number of different tennis scores after n points have been played.A051706
Number of different tennis scores after n points have been played.
- Number of factorizations of (n,n) into pairs (j,k).A051707
Number of factorizations of (n,n) into pairs (j,k).
- Number of ways to move a chess rook from the lower left corner to square (n,n), with the rook moving only up or right.A051708
Number of ways to move a chess rook from the lower left corner to square (n,n), with the rook moving only up or right.
- a(n) = sigma(n) + phi(n) - 2n.A051709
a(n) = sigma(n) + phi(n) - 2n.
- Prime numbers associated with A058941.A051710
Prime numbers associated with A058941.