Sequences
392,541 sequences
- Numbers which are the sum of their proper divisors containing the digit 0.A059461
Numbers which are the sum of their proper divisors containing the digit 0.
- Numbers which are the sum of their proper divisors containing the digit 3.A059462
Numbers which are the sum of their proper divisors containing the digit 3.
- Numbers which are the sum of their proper divisors containing the digit 4.A059463
Numbers which are the sum of their proper divisors containing the digit 4.
- Numbers which are the sum of their proper divisors containing the digit 5.A059464
Numbers which are the sum of their proper divisors containing the digit 5.
- Numbers which are the sum of their proper divisors containing the digit 6.A059465
Numbers which are the sum of their proper divisors containing the digit 6.
- Numbers which are the sum of their proper divisors containing the digit 7.A059466
Numbers which are the sum of their proper divisors containing the digit 7.
- Numbers which are the sum of their proper divisors containing the digit 8.A059467
Numbers which are the sum of their proper divisors containing the digit 8.
- Numbers which are the sum of their proper divisors containing the digit 9.A059468
Numbers which are the sum of their proper divisors containing the digit 9.
- Numbers that are the products of distinct substrings of themselves.A059469
Numbers that are the products of distinct substrings of themselves.
- Numbers that are the products of distinct substrings (>1) of themselves and do not end in 0.A059470
Numbers that are the products of distinct substrings (>1) of themselves and do not end in 0.
- a(1) = 2; a(n+1) is obtained by trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached.A059471
a(1) = 2; a(n+1) is obtained by trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached.
- Primes omitted from A059471.A059472
Primes omitted from A059471.
- Triangle T(n, k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w - 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, ...A059473
Triangle T(n, k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w - 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, ...
- Triangle read by rows: T(n,k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w + 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, ...A059474
Triangle read by rows: T(n,k) is coefficient of z^n*w^k in 1/(1 - 2*z - 2*w + 2*z*w) read by rows in order 00, 10, 01, 20, 11, 02, ...
- Number of 2n X 2n half-turn symmetric alternating-sign matrices (HTSASM's).A059475
Number of 2n X 2n half-turn symmetric alternating-sign matrices (HTSASM's).
- Number of 4n X 4n quarter-turn symmetric alternating-sign matrices (QTSASM's).A059476
Number of 4n X 4n quarter-turn symmetric alternating-sign matrices (QTSASM's).
- 3-enumeration of n X n alternating-sign matrices.A059477
3-enumeration of n X n alternating-sign matrices.
- Arrange irreducible polynomials over GF(2) in lexicographic order and write down the order of each polynomial.A059478
Arrange irreducible polynomials over GF(2) in lexicographic order and write down the order of each polynomial.
- Number of 3 X 3 matrices with elements from {0,...,n-1} such that the middle element of each of the eight lines of three (rows, columns and diagonals) is the square (mod n) of the difference of the end elements.A059479
Number of 3 X 3 matrices with elements from {0,...,n-1} such that the middle element of each of the eight lines of three (rows, columns and diagonals) is the square (mod n) of the difference of the end elements.
- a(0) = a(1) = 1; a(n) = a(n-1) + (n+1)*a(n-2).A059480
a(0) = a(1) = 1; a(n) = a(n-1) + (n+1)*a(n-2).
- Triangle read by rows. T(n, k) = binomial(n+k-1, k) for 0 <= k <= n.A059481
Triangle read by rows. T(n, k) = binomial(n+k-1, k) for 0 <= k <= n.
- a(0)=1, a(n) = a(n-1) + 8*10^(n-1).A059482
a(0)=1, a(n) = a(n-1) + 8*10^(n-1).
- Triangle T(n,k) = number of fixed 2 X n polyominoes with k cells = coefficient of x^n*y^k in (1+x*y)/(1-x*y-x*y^2-x^2*y^3)-1, read by rows in order 00, 10, 01, 20, 11, 02, ...A059483
Triangle T(n,k) = number of fixed 2 X n polyominoes with k cells = coefficient of x^n*y^k in (1+x*y)/(1-x*y-x*y^2-x^2*y^3)-1, read by rows in order 00, 10, 01, 20, 11, 02, ...
- Triangle T(n,k) = coefficient of x^n*y^k in 1/(1-x*y-x*y^2-x^2*y^3), read by rows in order 00, 10, 01, 20, 11, 02, ...A059484
Triangle T(n,k) = coefficient of x^n*y^k in 1/(1-x*y-x*y^2-x^2*y^3), read by rows in order 00, 10, 01, 20, 11, 02, ...
- Highest prime factor is greater than 3.A059485
Highest prime factor is greater than 3.
- 3-enumeration of 2n+1 X 2n+1 vertically symmetric alternating-sign matrices.A059486
3-enumeration of 2n+1 X 2n+1 vertically symmetric alternating-sign matrices.
- Number of 2-enumeration of 4n X 4n quarter-turn symmetric alternating-sign matrices.A059487
Number of 2-enumeration of 4n X 4n quarter-turn symmetric alternating-sign matrices.
- Expansion of generating function A_{UU}^(2)(4n;2,1,1).A059488
Expansion of generating function A_{UU}^(2)(4n;2,1,1).
- Expansion of generating function A_{UU}^(2)(4n;1,1,1).A059489
Expansion of generating function A_{UU}^(2)(4n;1,1,1).
- Expansion of generating function A_{QT}^(1)(4n;2).A059490
Expansion of generating function A_{QT}^(1)(4n;2).
- Expansion of generating function A_{QT}^(1)(4n;3).A059491
Expansion of generating function A_{QT}^(1)(4n;3).
- Expansion of generating function A_{UO}^(1)(8n).A059492
Expansion of generating function A_{UO}^(1)(8n).
- A005156(n)*A059488(n)^2.A059493
A005156(n)*A059488(n)^2.
- For odd p such that 2^p-1 is a prime (A000043), write 2^p-1 = x^2+3*y^2; sequence gives values of x.A059494
For odd p such that 2^p-1 is a prime (A000043), write 2^p-1 = x^2+3*y^2; sequence gives values of x.
- For odd p such that 2^p-1 is a prime (A000043), write 2^p-1 = x^2+3*y^2; sequence gives values of y.A059495
For odd p such that 2^p-1 is a prime (A000043), write 2^p-1 = x^2+3*y^2; sequence gives values of y.
- a(1) = 2; a(n+1) is obtained by and trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached. Take the lexicographically earliest sequence. Digits may be replaced by any nonzero digit.A059496
a(1) = 2; a(n+1) is obtained by and trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached. Take the lexicographically earliest sequence. Digits may be replaced by any nonzero digit.
- Primes omitted from A059496.A059497
Primes omitted from A059496.
- a(1) = 2; a(n+1) is obtained by trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached. Take the lexicographically earliest sequence. Digits may be replaced by any larger digit.A059498
a(1) = 2; a(n+1) is obtained by trying to change just one digit of a(n), starting with the least significant digit, until a new prime is reached. Take the lexicographically earliest sequence. Digits may be replaced by any larger digit.
- a(n) = |{m : multiplicative order of 2 mod m = n}|.A059499
a(n) = |{m : multiplicative order of 2 mod m = n}|.
- Primes p such that both q=(p-1)/2 and 2p + 1 = 4q + 3 are composite numbers. Intersection of A059456 and A053176.A059500
Primes p such that both q=(p-1)/2 and 2p + 1 = 4q + 3 are composite numbers. Intersection of A059456 and A053176.
- F(n)*2^n - 1 is prime, where F(n) is the n-th Fibonacci number.A059501
F(n)*2^n - 1 is prime, where F(n) is the n-th Fibonacci number.
- a(n) = (3*n*F(2n-1) + (3-n)*F(2n))/5 where F() = Fibonacci numbers A000045.A059502
a(n) = (3*n*F(2n-1) + (3-n)*F(2n))/5 where F() = Fibonacci numbers A000045.
- The array in A059502 read by antidiagonals in 'up' direction.A059503
The array in A059502 read by antidiagonals in 'up' direction.
- Numbers k with the property that reading k gives correct, although not necessarily complete, information about itself.A059504
Numbers k with the property that reading k gives correct, although not necessarily complete, information about itself.
- Transform of A059502 applied to sequence 2,3,4,...A059505
Transform of A059502 applied to sequence 2,3,4,...
- Transform of A059502 applied to sequence 3,4,5,...A059506
Transform of A059502 applied to sequence 3,4,5,...
- Transform of A059502 applied to sequence 4,5,6,...A059507
Transform of A059502 applied to sequence 4,5,6,...
- Transform of A059502 applied to sequence 5,6,7,...A059508
Transform of A059502 applied to sequence 5,6,7,...
- Main diagonal of the array A059503.A059509
Main diagonal of the array A059503.
- Main diagonal of the array A059220.A059510
Main diagonal of the array A059220.