Sequences
392,541 sequences
- Squares whose arithmetic mean of digits is an integer (i.e., the sum of digits is a multiple of the number of digits).A069711
Squares whose arithmetic mean of digits is an integer (i.e., the sum of digits is a multiple of the number of digits).
- Triangular numbers with arithmetic mean of digits = integer (sum of digits = A multiple of the number of digits).A069712
Triangular numbers with arithmetic mean of digits = integer (sum of digits = A multiple of the number of digits).
- As a square array T(n,k) by antidiagonals, number of ways of partitioning k into up to n parts each no more than 5, or into up to 5 parts each no more than n; as a triangle t(n,k), number of ways of partitioning n into exactly k parts each no more than 6 (i.e., of arranging k indistinguishable standard dice to produce a total of n).A069713
As a square array T(n,k) by antidiagonals, number of ways of partitioning k into up to n parts each no more than 5, or into up to 5 parts each no more than n; as a triangle t(n,k), number of ways of partitioning n into exactly k parts each no more than 6 (i.e., of arranging k indistinguishable standard dice to produce a total of n).
- Least integer k such that (sigma(k)-k)/(k-phi(k)) = n.A069714
Least integer k such that (sigma(k)-k)/(k-phi(k)) = n.
- GCD of digits of n is 1.A069715
GCD of digits of n is 1.
- Smallest number such that the LCM of the digits equals n, or 0 if no such number exists.A069716
Smallest number such that the LCM of the digits equals n, or 0 if no such number exists.
- B referred to in A056600.A069717
B referred to in A056600.
- C referred to in A056600.A069718
C referred to in A056600.
- Integer quotients arising in A068418: sum of proper divisors is divided by cototient of terms of A068418.A069719
Integer quotients arising in A068418: sum of proper divisors is divided by cototient of terms of A068418.
- a(n) = 2^(n-1)*binomial(2*n-1, n).A069720
a(n) = 2^(n-1)*binomial(2*n-1, n).
- Number of rooted unicursal planar maps with n edges and no vertices of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).A069721
Number of rooted unicursal planar maps with n edges and no vertices of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).
- Number of rooted unicursal planar maps with n edges and exactly one vertex of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).A069722
Number of rooted unicursal planar maps with n edges and exactly one vertex of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).
- a(n) = 2^(n-1)*binomial(2*n-3, n-1).A069723
a(n) = 2^(n-1)*binomial(2*n-3, n-1).
- Number of nonisomorphic unrooted unicursal planar maps with n edges (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).A069724
Number of nonisomorphic unrooted unicursal planar maps with n edges (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).
- Number of nonisomorphic unrooted unicursal planar maps with n edges and two vertices of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).A069725
Number of nonisomorphic unrooted unicursal planar maps with n edges and two vertices of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).
- Number of rooted planar bi-Eulerian maps with 2n edges. Bi-Eulerian: all its vertices and faces are of even valency.A069726
Number of rooted planar bi-Eulerian maps with 2n edges. Bi-Eulerian: all its vertices and faces are of even valency.
- Number of nonisomorphic unrooted Eulerian planar maps with n edges (Eulerian means that all vertices are of even valency; there is an Eulerian cycle).A069727
Number of nonisomorphic unrooted Eulerian planar maps with n edges (Eulerian means that all vertices are of even valency; there is an Eulerian cycle).
- Number of rooted non-separable Eulerian planar maps with n edges.A069728
Number of rooted non-separable Eulerian planar maps with n edges.
- Number of rooted non-separable bi-Eulerian planar maps with 2n edges. Bi-Eulerian means all its vertices and faces are of even valency.A069729
Number of rooted non-separable bi-Eulerian planar maps with 2n edges. Bi-Eulerian means all its vertices and faces are of even valency.
- Number of nonisomorphic unrooted unicursal planar maps with n edges.A069730
Number of nonisomorphic unrooted unicursal planar maps with n edges.
- Number of unicursal planar maps with n edges rooted at a vertex of odd valency (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).A069731
Number of unicursal planar maps with n edges rooted at a vertex of odd valency (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).
- Number of nonisomorphic unrooted unicursal planar maps with n edges and no vertices of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).A069732
Number of nonisomorphic unrooted unicursal planar maps with n edges and no vertices of valency 1 (unicursal means that exactly two vertices are of odd valency; there is an Eulerian path).
- Number of divisors d of n such that d or n/d is odd. Number of non-orientable coverings of the Klein bottle with n lists.A069733
Number of divisors d of n such that d or n/d is odd. Number of non-orientable coverings of the Klein bottle with n lists.
- Number of pairs (p,q), 0<=p<=q, such that p+q divides n.A069734
Number of pairs (p,q), 0<=p<=q, such that p+q divides n.
- Number of regular orientable coverings of the Klein bottle with 2n lists.A069735
Number of regular orientable coverings of the Klein bottle with 2n lists.
- Total number of Eulerian circuits in labeled multigraphs with n edges.A069736
Total number of Eulerian circuits in labeled multigraphs with n edges.
- Integer quotient defining A068418 is 3.A069737
Integer quotient defining A068418 is 3.
- Number of isomorphism classes of minimal n-extensions of a kind of homeomorphism of the circle.A069738
Number of isomorphism classes of minimal n-extensions of a kind of homeomorphism of the circle.
- Size of the key space for isomorphism verification of circulant graphs of order n.A069739
Size of the key space for isomorphism verification of circulant graphs of order n.
- Let M_n be the n X n matrix M_(i,j)=1/(i+j+ij); a(n) is the numerator of det(M_n).A069740
Let M_n be the n X n matrix M_(i,j)=1/(i+j+ij); a(n) is the numerator of det(M_n).
- Let M_n be the n X n matrix M_(i,j)=1/(2^i+2^j), then a(n) is the numerator of det(M_n).A069741
Let M_n be the n X n matrix M_(i,j)=1/(2^i+2^j), then a(n) is the numerator of det(M_n).
- Duplicate of A069743.A069742
Duplicate of A069743.
- Let M_n be the n X n matrix M_(i,j)=1/(3^i+3^j), then a(n) is the numerator of det(M_n).A069743
Let M_n be the n X n matrix M_(i,j)=1/(3^i+3^j), then a(n) is the numerator of det(M_n).
- Indices of prime Fibonacci numbers, minus 1.A069744
Indices of prime Fibonacci numbers, minus 1.
- Expansion of 1/((1-x^2)(1-x^3)(1-x^6)(1-x^7)(1-x^8)).A069745
Expansion of 1/((1-x^2)(1-x^3)(1-x^6)(1-x^7)(1-x^8)).
- Four-digit numbers that do not resolve to 6174 under the Kaprekar map (see A151949).A069746
Four-digit numbers that do not resolve to 6174 under the Kaprekar map (see A151949).
- Numbers n such that n and phi(n) are both palindromes.A069747
Numbers n such that n and phi(n) are both palindromes.
- Numbers k such that k and k^3 are both palindromes.A069748
Numbers k such that k and k^3 are both palindromes.
- Number of primes less than 10^n containing only the digits 2 and 3 (A020458).A069749
Number of primes less than 10^n containing only the digits 2 and 3 (A020458).
- a(1)=1; a(n+1) is the smallest integer such that 1/a(n+1) = 0.0...00a(n)xxxxx...A069750
a(1)=1; a(n+1) is the smallest integer such that 1/a(n+1) = 0.0...00a(n)xxxxx...
- Smallest k>n such that floor((11/10)^k)/floor((11/10)^n) is an integer.A069751
Smallest k>n such that floor((11/10)^k)/floor((11/10)^n) is an integer.
- Smallest k>n such that the triangular number n*(n+1)/2 divides the triangular number k*(k+1)/2.A069752
Smallest k>n such that the triangular number n*(n+1)/2 divides the triangular number k*(k+1)/2.
- Smallest k>n such that the tetrahedral number n*(n+1)*(n+2)/6 divides the tetrahedral number k*(k+1)*(k+2)/6.A069753
Smallest k>n such that the tetrahedral number n*(n+1)*(n+2)/6 divides the tetrahedral number k*(k+1)*(k+2)/6.
- Counts transitions between prime and nonprime to reach the number n.A069754
Counts transitions between prime and nonprime to reach the number n.
- Frobenius number of the numerical semigroup generated by 3 consecutive triangular numbers.A069755
Frobenius number of the numerical semigroup generated by 3 consecutive triangular numbers.
- Frobenius number of the numerical semigroup generated by consecutive squares.A069756
Frobenius number of the numerical semigroup generated by consecutive squares.
- Frobenius number of the numerical semigroup generated by three consecutive pentagonal numbers.A069757
Frobenius number of the numerical semigroup generated by three consecutive pentagonal numbers.
- Frobenius number of the numerical semigroup generated by three consecutive hexagonal numbers.A069758
Frobenius number of the numerical semigroup generated by three consecutive hexagonal numbers.
- Frobenius number of the numerical semigroup generated by consecutive hex numbers.A069759
Frobenius number of the numerical semigroup generated by consecutive hex numbers.
- Frobenius number of the numerical semigroup generated by consecutive centered square numbers.A069760
Frobenius number of the numerical semigroup generated by consecutive centered square numbers.