Sequences
392,541 sequences
- Numbers whose square has initial digit '7'.A045861
Numbers whose square has initial digit '7'.
- Numbers whose square has initial digit '8'.A045862
Numbers whose square has initial digit '8'.
- Numbers whose square has initial digit '9'.A045863
Numbers whose square has initial digit '9'.
- Number of root quadruples with entry -n for integer Apollonian circle packings.A045864
Number of root quadruples with entry -n for integer Apollonian circle packings.
- Theta series of quadratic form with Gram matrix [ 4, 0, 2, 1; 0, 2, 1, 1; 2, 1, 20, 1; 1, 1, 1, 10 ].A045865
Theta series of quadratic form with Gram matrix [ 4, 0, 2, 1; 0, 2, 1, 1; 2, 1, 20, 1; 1, 1, 1, 10 ].
- Theta series of quadratic form with Gram matrix [ 2, 1, 0, 1; 1, 8, 1, -3; 0, 1, 10, 2; 1, -3, 2, 12 ].A045866
Theta series of quadratic form with Gram matrix [ 2, 1, 0, 1; 1, 8, 1, -3; 0, 1, 10, 2; 1, -3, 2, 12 ].
- Theta series of quadratic form with Gram matrix [ 4, 1, 2, 1; 1, 4, 1, 0; 2, 1, 6, -2; 1, 0, -2, 20 ].A045867
Theta series of quadratic form with Gram matrix [ 4, 1, 2, 1; 1, 4, 1, 0; 2, 1, 6, -2; 1, 0, -2, 20 ].
- Expansion of g.f.: ((1 - x - sqrt(1-6*x+5*x^2))/(2*x))^2.A045868
Expansion of g.f.: ((1 - x - sqrt(1-6*x+5*x^2))/(2*x))^2.
- Integers k such that in the list of divisors of k (in base 5), each digit 0-4 appears equally often.A045869
Integers k such that in the list of divisors of k (in base 5), each digit 0-4 appears equally often.
- Number of times the digits are repeated in A045869.A045870
Number of times the digits are repeated in A045869.
- Numbers n with the property that in the list of divisors of n (in octal), each digit 0-7 appears equally often.A045871
Numbers n with the property that in the list of divisors of n (in octal), each digit 0-7 appears equally often.
- a(n) = A006792(n)/2.A045872
a(n) = A006792(n)/2.
- a(n) = A006496(n)/2.A045873
a(n) = A006496(n)/2.
- a(1)=1, a(n) is smallest multiple of n with same beginning as a(n-1).A045874
a(1)=1, a(n) is smallest multiple of n with same beginning as a(n-1).
- a(n) is the smallest m for which the decimal representation of 2^m contains n consecutive identical digits.A045875
a(n) is the smallest m for which the decimal representation of 2^m contains n consecutive identical digits.
- Sum of different permutations of digits of n (leading 0's allowed).A045876
Sum of different permutations of digits of n (leading 0's allowed).
- Rotating digits of a(n)^2 right once still yields a square.A045877
Rotating digits of a(n)^2 right once still yields a square.
- Numbers k such that rotating digits of k^2 left once still yields a square.A045878
Numbers k such that rotating digits of k^2 left once still yields a square.
- Numbers whose square contains the same digits as some other square.A045879
Numbers whose square contains the same digits as some other square.
- Integers whose square root is "well approximated" by other square roots of integers.A045880
Integers whose square root is "well approximated" by other square roots of integers.
- Smallest of first string of exactly 2n-1 consecutive composite integers.A045881
Smallest of first string of exactly 2n-1 consecutive composite integers.
- Smallest term of first run of (at least) n consecutive integers which are not squarefree.A045882
Smallest term of first run of (at least) n consecutive integers which are not squarefree.
- a(n) = ((3*n+1)*2^n - (-1)^n)/9.A045883
a(n) = ((3*n+1)*2^n - (-1)^n)/9.
- Largest number m such that in base n, the sum of digits in the divisors of m is m (written in base n).A045884
Largest number m such that in base n, the sum of digits in the divisors of m is m (written in base n).
- Largest number m such that in base n, the sum of digits in the divisors of m is m (written in base 10).A045885
Largest number m such that in base n, the sum of digits in the divisors of m is m (written in base 10).
- Erroneous version of A003462.A045886
Erroneous version of A003462.
- Number of distinct even numbers visible as proper subsequences of n.A045887
Number of distinct even numbers visible as proper subsequences of n.
- Number of distinct odd numbers visible as proper subsequences of n.A045888
Number of distinct odd numbers visible as proper subsequences of n.
- Partial sums of A045618.A045889
Partial sums of A045618.
- Catafusenes (see reference for precise definition).A045890
Catafusenes (see reference for precise definition).
- First differences of A045623.A045891
First differences of A045623.
- Solutions s to the equation 1=s*prime(n)+t*prime(n+1) with |s| as small as possible.A045892
Solutions s to the equation 1=s*prime(n)+t*prime(n+1) with |s| as small as possible.
- Solutions t to the equation s*prime(n) + t*prime(n+1) = 1 with |s| as small as possible.A045893
Solutions t to the equation s*prime(n) + t*prime(n+1) = 1 with |s| as small as possible.
- 4-fold convolution of A001700(n), n >= 0.A045894
4-fold convolution of A001700(n), n >= 0.
- Period length of pairs (a,b) where a has period 2n-2 and b has period n.A045895
Period length of pairs (a,b) where a has period 2n-2 and b has period n.
- Denominator of n/((n+1)*(n+2)) = A026741/A045896.A045896
Denominator of n/((n+1)*(n+2)) = A026741/A045896.
- Has both a primitive and imprimitive representation as x^2 + xy + y^2.A045897
Has both a primitive and imprimitive representation as x^2 + xy + y^2.
- a(n) = one of five triples of directions in n-th triple of moves in the optimal solution of the Tower of Hanoi; it is a squarefree sequence over a five-letter alphabet.A045898
a(n) = one of five triples of directions in n-th triple of moves in the optimal solution of the Tower of Hanoi; it is a squarefree sequence over a five-letter alphabet.
- Numbers k such that k+1 and 3*k+1 are perfect squares.A045899
Numbers k such that k+1 and 3*k+1 are perfect squares.
- Hypothetical numbers of terms in general expressions for coefficients of Lovelock Lagrangians.A045900
Hypothetical numbers of terms in general expressions for coefficients of Lovelock Lagrangians.
- Group the natural numbers into blocks: B_1 = 1, B_2 = 2,3,4, B_3 = 5,6,7,8,9, ..., each block ending in a square. Permute each block B_k by beginning with the central term, followed by the transposed symmetric pairs from B_k.A045901
Group the natural numbers into blocks: B_1 = 1, B_2 = 2,3,4, B_3 = 5,6,7,8,9, ..., each block ending in a square. Permute each block B_k by beginning with the central term, followed by the transposed symmetric pairs from B_k.
- Catafusenes (see reference for precise definition).A045902
Catafusenes (see reference for precise definition).
- Number of nonisomorphic systems of catafusenes in an example in Cyvin et al. (1994) with two appendages to the core indexed by the total number of hexagons in the appendages.A045903
Number of nonisomorphic systems of catafusenes in an example in Cyvin et al. (1994) with two appendages to the core indexed by the total number of hexagons in the appendages.
- Nonisomorphic catacondensed monoheptafusenes (see reference for precise definition).A045904
Nonisomorphic catacondensed monoheptafusenes (see reference for precise definition).
- Catafusenes (see reference for precise definition).A045905
Catafusenes (see reference for precise definition).
- Numbers of nonisomorphic systems of catafusenes (see Cyvin et al. (1994) for precise definition).A045906
Numbers of nonisomorphic systems of catafusenes (see Cyvin et al. (1994) for precise definition).
- Catafusenes (see reference for precise definition).A045907
Catafusenes (see reference for precise definition).
- Number of catafusenes with C_{2v}(b) symmetry (see reference for precise definition).A045908
Number of catafusenes with C_{2v}(b) symmetry (see reference for precise definition).
- Number of unsymmetrical catafusenes with n hexagons (see reference for precise definition).A045909
Number of unsymmetrical catafusenes with n hexagons (see reference for precise definition).
- Numbers with digits nondecreasing and their reciprocals sum to 1/(positive integer).A045910
Numbers with digits nondecreasing and their reciprocals sum to 1/(positive integer).