Sequences
392,541 sequences
- Numbers k such that k concatenated with k-1 is prime.A054211
Numbers k such that k concatenated with k-1 is prime.
- a(n)^5 is the smallest fifth power whose decimal digits occur with same frequency n.A054212
a(n)^5 is the smallest fifth power whose decimal digits occur with same frequency n.
- Smallest fifth powers whose decimal expansion digits occur with same frequency n.A054213
Smallest fifth powers whose decimal expansion digits occur with same frequency n.
- Numbers n such that n concatenated with n-1 is a square.A054214
Numbers n such that n concatenated with n-1 is a square.
- Squares that are concatenations of two consecutive decreasing numbers.A054215
Squares that are concatenations of two consecutive decreasing numbers.
- Numbers m such that m^2 is a concatenation of two consecutive decreasing numbers.A054216
Numbers m such that m^2 is a concatenation of two consecutive decreasing numbers.
- Primes p with property that p concatenated with its emirp p' (prime reversal) forms a palindromic prime of the form 'primemirp' (rightmost digit of p and leftmost digit of p' are blended together - p and p' palindromic allowed).A054217
Primes p with property that p concatenated with its emirp p' (prime reversal) forms a palindromic prime of the form 'primemirp' (rightmost digit of p and leftmost digit of p' are blended together - p and p' palindromic allowed).
- Palindromic primes of the form 'primemirp' resulting from A054217.A054218
Palindromic primes of the form 'primemirp' resulting from A054217.
- Concatenation of n in base 10 down to base 2 is divisible by at least one of these base b numbers, all numbers interpreted as decimals.A054219
Concatenation of n in base 10 down to base 2 is divisible by at least one of these base b numbers, all numbers interpreted as decimals.
- Concatenation of n in base 2 up to base 10 is divisible by at least one of these base b numbers, all numbers interpreted as decimals.A054220
Concatenation of n in base 2 up to base 10 is divisible by at least one of these base b numbers, all numbers interpreted as decimals.
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2,3)=binomial(j+2,3)+k^3, ordered by increasing i; sequence gives i values.A054221
Consider all integer triples (i,j,k), j,k>0, with binomial(i+2,3)=binomial(j+2,3)+k^3, ordered by increasing i; sequence gives i values.
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2, 3) = binomial(j+2, 3) + k^3, ordered by increasing i; sequence gives j values.A054222
Consider all integer triples (i,j,k), j,k>0, with binomial(i+2, 3) = binomial(j+2, 3) + k^3, ordered by increasing i; sequence gives j values.
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2,3)=binomial(j+2,3)+k^3, ordered by increasing i; sequence gives k values.A054223
Consider all integer triples (i,j,k), j,k>0, with binomial(i+2,3)=binomial(j+2,3)+k^3, ordered by increasing i; sequence gives k values.
- A054221 without cubes.A054224
A054221 without cubes.
- Triangle read by rows: row n (n>=0) gives the number of partitions of (n,0), (n-1,1), (n-2,2), ..., (0,n) respectively into sums of pairs.A054225
Triangle read by rows: row n (n>=0) gives the number of partitions of (n,0), (n-1,1), (n-2,2), ..., (0,n) respectively into sums of pairs.
- Number of positive integers <= 2^n of form x^2 + 11 y^2.A054226
Number of positive integers <= 2^n of form x^2 + 11 y^2.
- Number of positive integers <= 2^n of form x^2 + 13 y^2.A054227
Number of positive integers <= 2^n of form x^2 + 13 y^2.
- Number of positive integers <= 2^n of form x^2 + 14 y^2.A054228
Number of positive integers <= 2^n of form x^2 + 14 y^2.
- Number of positive integers <= 2^n of form x^2 + 15 y^2.A054229
Number of positive integers <= 2^n of form x^2 + 15 y^2.
- Number of positive integers <= 2^n of form x^2 + 17 y^2.A054230
Number of positive integers <= 2^n of form x^2 + 17 y^2.
- Number of positive integers <= 2^n of form x^2 + 18 y^2.A054231
Number of positive integers <= 2^n of form x^2 + 18 y^2.
- Number of positive integers <= 2^n of form x^2 + 19 y^2.A054232
Number of positive integers <= 2^n of form x^2 + 19 y^2.
- Number of positive integers <= 2^n of form x^2 + 20 y^2.A054233
Number of positive integers <= 2^n of form x^2 + 20 y^2.
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives i values.A054234
Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives i values.
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives j values.A054235
Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives j values.
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives k values.A054236
Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives k values.
- Pair addition table cast as diagonal numbers.A054237
Pair addition table cast as diagonal numbers.
- Array read by downward antidiagonals: T(i,j) = bits of binary expansion of i interleaved with that of j.A054238
Array read by downward antidiagonals: T(i,j) = bits of binary expansion of i interleaved with that of j.
- Inverse of A054238.A054239
Inverse of A054238.
- Bit-interleaved number addition table; like binary addition but carries shift 2 instead of 1; addition base sqrt(2).A054240
Bit-interleaved number addition table; like binary addition but carries shift 2 instead of 1; addition base sqrt(2).
- Number of partitions of bit-interleaved numbers; partitions of n in base sqrt(2).A054241
Number of partitions of bit-interleaved numbers; partitions of n in base sqrt(2).
- Triangle read by rows: row n (n>=0) gives the number of partitions of (n,0), (n-1,1), (n-2,2), ..., (0,n) respectively into sums of distinct pairs.A054242
Triangle read by rows: row n (n>=0) gives the number of partitions of (n,0), (n-1,1), (n-2,2), ..., (0,n) respectively into sums of distinct pairs.
- Number of partitions of n into distinct positive parts <= n, where parts are combined by XOR.A054243
Number of partitions of n into distinct positive parts <= n, where parts are combined by XOR.
- Number of partitions of n into distinct positive parts <= n, with parts combined by IOR (inclusive or).A054244
Number of partitions of n into distinct positive parts <= n, with parts combined by IOR (inclusive or).
- Beethoven's Fifth Symphony; 1 stands for the first note in the minor scale, etc.A054245
Beethoven's Fifth Symphony; 1 stands for the first note in the minor scale, etc.
- Non-Cayley-isomorphic circulant p^2-tournaments, indexed by odd primes p.A054246
Non-Cayley-isomorphic circulant p^2-tournaments, indexed by odd primes p.
- Number of n X n binary matrices under action of dihedral group of the square D_4.A054247
Number of n X n binary matrices under action of dihedral group of the square D_4.
- Binary entropy: a(n) = n + min { a(k)+a(n-k) : 1 <= k <= n-1 }.A054248
Binary entropy: a(n) = n + min { a(k)+a(n-k) : 1 <= k <= n-1 }.
- Alternately subtract and add 1 to digits in decimal expansion of Pi.A054249
Alternately subtract and add 1 to digits in decimal expansion of Pi.
- Triangular array T(n,0)= 1, T(n,k) = sum_{j=1..min(n,k)} (n-j+1)*T(j,k-j) if k>0.A054250
Triangular array T(n,0)= 1, T(n,k) = sum_{j=1..min(n,k)} (n-j+1)*T(j,k-j) if k>0.
- a(0) = 1; a(n) = Sum_{0 <= k < n and gcd(k, n) != 1} a(k).A054251
a(0) = 1; a(n) = Sum_{0 <= k < n and gcd(k, n) != 1} a(k).
- Triangle T(n,k) of n X n binary matrices with k=0..n^2 ones under action of dihedral group of the square D_4.A054252
Triangle T(n,k) of n X n binary matrices with k=0..n^2 ones under action of dihedral group of the square D_4.
- a(n) = n + max{ a(i)*a(n-i) ; 1 <= i <= n-1 }, a(n) = n for n <= 2.A054253
a(n) = n + max{ a(i)*a(n-i) ; 1 <= i <= n-1 }, a(n) = n for n <= 2.
- a(n) is n plus the minimum of the a(i)*a(n-i) of the previous i = 1..n-1.A054254
a(n) is n plus the minimum of the a(i)*a(n-i) of the previous i = 1..n-1.
- Triangle T(n,k) (n >= 1, 0<=k<=n) giving number of preferential arrangements of n things beginning with k (transposed, then read by rows).A054255
Triangle T(n,k) (n >= 1, 0<=k<=n) giving number of preferential arrangements of n things beginning with k (transposed, then read by rows).
- Concatenation of n in base 2 up to base 10 is prime, all numbers are interpreted as decimals.A054256
Concatenation of n in base 2 up to base 10 is prime, all numbers are interpreted as decimals.
- Concatenation of n in base 10 down up to base 2 is prime, all numbers are interpreted as decimals.A054257
Concatenation of n in base 10 down up to base 2 is prime, all numbers are interpreted as decimals.
- Concatenation of n in base 2 up to base 10 and n in base 10 down to base 2 is prime, all numbers are interpreted as decimals.A054258
Concatenation of n in base 2 up to base 10 and n in base 10 down to base 2 is prime, all numbers are interpreted as decimals.
- Squares having last digit equal to the sum of the other digits.A054259
Squares having last digit equal to the sum of the other digits.
- Smallest prime that contains all of the first n primes as substrings.A054260
Smallest prime that contains all of the first n primes as substrings.