Sequences
392,541 sequences
- Abjad values of the Arabic letters in the traditional order for abjad calculations.A071061
Abjad values of the Arabic letters in the traditional order for abjad calculations.
- Minimal set of prime-strings in base 10.A071062
Minimal set of prime-strings in base 10.
- Determinant of n X n matrix defined by m(i,j) = 0 if i+j is a prime, m(i,j) = 1 otherwise.A071063
Determinant of n X n matrix defined by m(i,j) = 0 if i+j is a prime, m(i,j) = 1 otherwise.
- Numbers divisible by the sum of factorials of their digits [A061602(n)] and also terminate in the sum of factorials of their digits.A071064
Numbers divisible by the sum of factorials of their digits [A061602(n)] and also terminate in the sum of factorials of their digits.
- A permutation of natural numbers: a(1)=2 a(n) is the smallest integer different from a(1), a(2), a(3), ..., a(n-1) such that a(n)+n is prime.A071065
A permutation of natural numbers: a(1)=2 a(n) is the smallest integer different from a(1), a(2), a(3), ..., a(n-1) such that a(n)+n is prime.
- Palindromic prime pyramid with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 6.A071066
Palindromic prime pyramid with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 6.
- First highest palindromic prime pyramid with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 4.A071067
First highest palindromic prime pyramid with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 4.
- Number of ways to write n as a sum of two unordered squarefree numbers.A071068
Number of ways to write n as a sum of two unordered squarefree numbers.
- a(n) = min { A070923(k) | n^3 < k < (n+1)^3 }.A071069
a(n) = min { A070923(k) | n^3 < k < (n+1)^3 }.
- Minimal set of composite-strings in base 10.A071070
Minimal set of composite-strings in base 10.
- Minimal "powers of 2" set in base 10: any power of 2 contains at least one term of this sequence in its decimal expansion.A071071
Minimal "powers of 2" set in base 10: any power of 2 contains at least one term of this sequence in its decimal expansion.
- Minimal "multiples of 4" set in base 10.A071072
Minimal "multiples of 4" set in base 10.
- Minimal "multiples of 3" set in base 10.A071073
Minimal "multiples of 3" set in base 10.
- Sprague-Grundy values for the game of Double Kayles (octal game .7777).A071074
Sprague-Grundy values for the game of Double Kayles (octal game .7777).
- Number of permutations that avoid the generalized pattern 132-4.A071075
Number of permutations that avoid the generalized pattern 132-4.
- Number of permutations that avoid the generalized pattern 123-4.A071076
Number of permutations that avoid the generalized pattern 123-4.
- Number of permutations that avoid the generalized pattern 1234-5.A071077
Number of permutations that avoid the generalized pattern 1234-5.
- Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th prime or if i=j, 1.A071078
Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th prime or if i=j, 1.
- Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th prime or if i=j, 0.A071079
Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th prime or if i=j, 0.
- Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th composite number, or 1 if i=j.A071080
Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th composite number, or 1 if i=j.
- Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th composite number, or 0 if i=j.A071081
Determinant of the n X n matrix whose element (i,j) equals the |i-j|-th composite number, or 0 if i=j.
- Determinant of the n X n matrix whose element (i,j) equals the (i-j)-th composite number, (j-i)-th prime number, or 1 if i=j.A071082
Determinant of the n X n matrix whose element (i,j) equals the (i-j)-th composite number, (j-i)-th prime number, or 1 if i=j.
- Determinant of the n X n matrix whose element (i,j) equals phi(|i-j|).A071083
Determinant of the n X n matrix whose element (i,j) equals phi(|i-j|).
- Determinant of the n X n matrix whose element (i,j) equals t(|i-j|) where t(n) is the number of divisors of n and t(0) = 0.A071084
Determinant of the n X n matrix whose element (i,j) equals t(|i-j|) where t(n) is the number of divisors of n and t(0) = 0.
- Determinant of the n X n matrix whose element (i,j) equals mu(|i-j|) where mu(k) is the moebius function for k > 0 and mu(0) = 0.A071085
Determinant of the n X n matrix whose element (i,j) equals mu(|i-j|) where mu(k) is the moebius function for k > 0 and mu(0) = 0.
- Number of integers of the form (nk)^2/(n^2+k^2), k>=1.A071086
Number of integers of the form (nk)^2/(n^2+k^2), k>=1.
- w values for A071352.A071087
w values for A071352.
- Number of permutations that avoid the generalized pattern 12345-6.A071088
Number of permutations that avoid the generalized pattern 12345-6.
- Remainder when sum of first n primes is divided by n-th prime.A071089
Remainder when sum of first n primes is divided by n-th prime.
- Sum of middle divisors of n.A071090
Sum of middle divisors of n.
- Number of tilings by lozenges of hexagon with sides 2n, 2n+3, 2n, 2n+3, 2n, 2n+3 and middle triangle in each edge removed.A071091
Number of tilings by lozenges of hexagon with sides 2n, 2n+3, 2n, 2n+3, 2n, 2n+3 and middle triangle in each edge removed.
- Erroneous version of A374083.A071092
Erroneous version of A374083.
- Number of perfect matchings in triangle graph with n nodes per side as n runs through numbers congruent to 0 or 3 mod 4.A071093
Number of perfect matchings in triangle graph with n nodes per side as n runs through numbers congruent to 0 or 3 mod 4.
- Number of ways to tile hexagon of edges n, n, n+1, n, n, n+1 with diamonds of side 1.A071094
Number of ways to tile hexagon of edges n, n, n+1, n, n, n+1 with diamonds of side 1.
- Number of ways to tile hexagon of edges n, n+1, n+1, n, n+1, n+1 with diamonds of side 1.A071095
Number of ways to tile hexagon of edges n, n+1, n+1, n, n+1, n+1 with diamonds of side 1.
- Number of ways to tile hexagon of edges n, n+1, n+2, n, n+1, n+2 with diamonds of side 1.A071096
Number of ways to tile hexagon of edges n, n+1, n+2, n, n+1, n+2 with diamonds of side 1.
- Number of ways to tile Aztec diamond of order n with 2 squares removed with dominoes.A071097
Number of ways to tile Aztec diamond of order n with 2 squares removed with dominoes.
- Number of ways to tile 4n X 4n square with n squares removed with dominoes.A071098
Number of ways to tile 4n X 4n square with n squares removed with dominoes.
- a(n) = (n-1)*(n+3) - 2^n + 4.A071099
a(n) = (n-1)*(n+3) - 2^n + 4.
- Expansion of (5 + 3*x + x^2 - x^3) / (1 - 2*x - 2*x^2 - 2*x^3 + x^4) in powers of x.A071100
Expansion of (5 + 3*x + x^2 - x^3) / (1 - 2*x - 2*x^2 - 2*x^3 + x^4) in powers of x.
- Expansion of (5 + 6*x + 3*x^2 - 2*x^3) / (1 - 2*x - 2*x^2 - 2*x^3 + x^4) in powers of x.A071101
Expansion of (5 + 6*x + 3*x^2 - 2*x^3) / (1 - 2*x - 2*x^2 - 2*x^3 + x^4) in powers of x.
- Determinant of KK* where K is Kasteleyn-Percus matrix for fool's diamond of order n.A071102
Determinant of KK* where K is Kasteleyn-Percus matrix for fool's diamond of order n.
- Number of perfect matchings in variant of n X n+2 Aztec rectangle graph.A071103
Number of perfect matchings in variant of n X n+2 Aztec rectangle graph.
- Number of perfect matchings in variant of 2n-1 X 2n Aztec rectangle graph.A071104
Number of perfect matchings in variant of 2n-1 X 2n Aztec rectangle graph.
- Number of perfect matchings in variant of right triangle graph with n edges.A071105
Number of perfect matchings in variant of right triangle graph with n edges.
- Number of perfect matchings in variant of right triangle graph with n edges where n runs through numbers congruent to 0 or 3 mod 4.A071106
Number of perfect matchings in variant of right triangle graph with n edges where n runs through numbers congruent to 0 or 3 mod 4.
- a(n) is the greatest integer that can be obtained from the integers {1, 2, 3, ..., n} using each number at most once and the operators +,-,*,/,^.A071107
a(n) is the greatest integer that can be obtained from the integers {1, 2, 3, ..., n} using each number at most once and the operators +,-,*,/,^.
- CONTINUANT transform of {d(n)}, 1, 2, 2, 3, 2, 4, ... (A000005).A071108
CONTINUANT transform of {d(n)}, 1, 2, 2, 3, 2, 4, ... (A000005).
- Expansion of Product_{k>=1} 1/(1+2*x^k).A071109
Expansion of Product_{k>=1} 1/(1+2*x^k).
- a(n) is the smallest integer >=0 we cannot obtain from n, n+1, n+2, n+3, n+4 and the operators +, -, *, /, using each number only once.A071110
a(n) is the smallest integer >=0 we cannot obtain from n, n+1, n+2, n+3, n+4 and the operators +, -, *, /, using each number only once.