Sequences
392,541 sequences
- a(1) = 1; a(n) = n^n mod (n-1)^(n-1) for n > 1.A066611
a(1) = 1; a(n) = n^n mod (n-1)^(n-1) for n > 1.
- Number of primes between n^n and (n+1)^(n+1).A066612
Number of primes between n^n and (n+1)^(n+1).
- Numbers k such that the product of the nonzero digits of k equals the number of divisors of k.A066613
Numbers k such that the product of the nonzero digits of k equals the number of divisors of k.
- Erroneous version of A053614.A066614
Erroneous version of A053614.
- Numbers that are not the sum of two or three distinct primes.A066615
Numbers that are not the sum of two or three distinct primes.
- a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).A066616
a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).
- Composites of form prime+1 containing a record number of prime factors.A066617
Composites of form prime+1 containing a record number of prime factors.
- Both m and its reverse are one more than a square and m does not end in 0.A066618
Both m and its reverse are one more than a square and m does not end in 0.
- Both n and its reverse are one less than a square.A066619
Both n and its reverse are one less than a square.
- Number of unordered triples of distinct pairwise coprime divisors of n.A066620
Number of unordered triples of distinct pairwise coprime divisors of n.
- Concatenation of triangular numbers in increasing order up to the n-th and then in decreasing order.A066621
Concatenation of triangular numbers in increasing order up to the n-th and then in decreasing order.
- Concatenation of prime numbers in increasing order up to the n-th and then in decreasing order.A066622
Concatenation of prime numbers in increasing order up to the n-th and then in decreasing order.
- Concatenation of squares in increasing order up to the n-th and then in decreasing order.A066623
Concatenation of squares in increasing order up to the n-th and then in decreasing order.
- Number of 1's in binary expansion of parts in all partitions of n.A066624
Number of 1's in binary expansion of parts in all partitions of n.
- Concatenation of factorials in increasing order up to the n-th and then in decreasing order.A066625
Concatenation of factorials in increasing order up to the n-th and then in decreasing order.
- Concatenation of cubes in increasing order up to the n-th and then in decreasing order.A066626
Concatenation of cubes in increasing order up to the n-th and then in decreasing order.
- Concatenation of numbers k^k in increasing order up to the n-th and then in decreasing order.A066627
Concatenation of numbers k^k in increasing order up to the n-th and then in decreasing order.
- a(n) = n - the largest Fibonacci number <= n.A066628
a(n) = n - the largest Fibonacci number <= n.
- a(n) = 2*Fibonacci(n+2) + ((-1)^n - 3)/2.A066629
a(n) = 2*Fibonacci(n+2) + ((-1)^n - 3)/2.
- Fibonacci numbers which are a nontrivial concatenation of Fibonacci numbers.A066630
Fibonacci numbers which are a nontrivial concatenation of Fibonacci numbers.
- The sequence f(1), f(2), ... as defined in A068192.A066631
The sequence f(1), f(2), ... as defined in A068192.
- Composites of form prime-1 containing a record number of prime factors.A066632
Composites of form prime-1 containing a record number of prime factors.
- Triangle T(n,k), n >= 1, 1 <= k <= n, giving number of k's in all partitions of n.A066633
Triangle T(n,k), n >= 1, 1 <= k <= n, giving number of k's in all partitions of n.
- Number of triangulations of the cyclic polytope C(n, n-5).A066634
Number of triangulations of the cyclic polytope C(n, n-5).
- Distance from n to closest square different from n.A066635
Distance from n to closest square different from n.
- a(n) = A066638(n)/n, where A066638(n) is the smallest power of a squarefree kernel of n that is a multiple of n.A066636
a(n) = A066638(n)/n, where A066638(n) is the smallest power of a squarefree kernel of n that is a multiple of n.
- Total number of elements in all factorizations of n with all factors > 1.A066637
Total number of elements in all factorizations of n with all factors > 1.
- Smallest power of a squarefree number that is a multiple of n.A066638
Smallest power of a squarefree number that is a multiple of n.
- Number of partitions of n with floor(n/2) parts.A066639
Number of partitions of n with floor(n/2) parts.
- Numbers such that all divisors have only odd digits.A066640
Numbers such that all divisors have only odd digits.
- a(n) = floor(n^sqrt(n)).A066641
a(n) = floor(n^sqrt(n)).
- a(n) = floor(n^(n/2)).A066642
a(n) = floor(n^(n/2)).
- a(n) = floor(Pi*n^2).A066643
a(n) = floor(Pi*n^2).
- a(n) = floor(surface area of a sphere with radius n).A066644
a(n) = floor(surface area of a sphere with radius n).
- a(n) = floor( (4/3)*Pi*n^3 ).A066645
a(n) = floor( (4/3)*Pi*n^3 ).
- Arrange the permutations of {1..m} in lexicographic order. Sequence gives indices of permutations of orders 1 or 2.A066646
Arrange the permutations of {1..m} in lexicographic order. Sequence gives indices of permutations of orders 1 or 2.
- Squares of the form a^2 + b^3 with a, b > 0.A066647
Squares of the form a^2 + b^3 with a, b > 0.
- Cubes of the form a^2 + b^3 with a, b > 0.A066648
Cubes of the form a^2 + b^3 with a, b > 0.
- Primes of the form a^2 + b^3 with a, b > 0.A066649
Primes of the form a^2 + b^3 with a, b > 0.
- Numbers not of the form a^2 + b^3 with a, b > 0.A066650
Numbers not of the form a^2 + b^3 with a, b > 0.
- Primes of the form 2*s + 1, where s is a squarefree number (A005117).A066651
Primes of the form 2*s + 1, where s is a squarefree number (A005117).
- Primes of the form 2*s - 1, where s is a squarefree number (A005117).A066652
Primes of the form 2*s - 1, where s is a squarefree number (A005117).
- Squarefree numbers k such that the pair 2*k +- 1 is a twin prime pair.A066653
Squarefree numbers k such that the pair 2*k +- 1 is a twin prime pair.
- Continued fraction for the Hardy-Littlewood constant Product_{p prime >= 5} (1-(3*p-1)/(p-1)^3).A066654
Continued fraction for the Hardy-Littlewood constant Product_{p prime >= 5} (1-(3*p-1)/(p-1)^3).
- Number of partitions of n*(n-1)/2.A066655
Number of partitions of n*(n-1)/2.
- a(n) = A000031(n) - A001037(n).A066656
a(n) = A000031(n) - A001037(n).
- Numerators of rational numbers produced in order by A066720(j)/A066720(i) for i >= 1, 1 <= j <i.A066657
Numerators of rational numbers produced in order by A066720(j)/A066720(i) for i >= 1, 1 <= j <i.
- Denominators of rational numbers produced in order by A066720(j)/A066720(i) for i >= 1, 1 <= j <i.A066658
Denominators of rational numbers produced in order by A066720(j)/A066720(i) for i >= 1, 1 <= j <i.
- Least k > n such that phi(k) = phi(n), if such k exists; = 0 otherwise.A066659
Least k > n such that phi(k) = phi(n), if such k exists; = 0 otherwise.
- Number of divisors of 2n excluding 1.A066660
Number of divisors of 2n excluding 1.