Sequences
392,541 sequences
- Neither a cube nor the sum of a nonnegative cube and a prime.A045911
Neither a cube nor the sum of a nonnegative cube and a prime.
- Triangle of coefficients of characteristic polynomial of negative Pascal matrix with (i,j)-th entry -C(i+j-2,i-1).A045912
Triangle of coefficients of characteristic polynomial of negative Pascal matrix with (i,j)-th entry -C(i+j-2,i-1).
- Kaprekar numbers: numbers k such that k = q + r and k^2 = q*10^m + r, for some m >= 1, q >= 0 and 0 <= r < 10^m. Here q and r must both have the same number of digits.A045913
Kaprekar numbers: numbers k such that k = q + r and k^2 = q*10^m + r, for some m >= 1, q >= 0 and 0 <= r < 10^m. Here q and r must both have the same number of digits.
- Triangular numbers with all digits the same.A045914
Triangular numbers with all digits the same.
- Erroneous version of A057835.A045915
Erroneous version of A057835.
- Erroneous version of A057752.A045916
Erroneous version of A057752.
- From Goldbach problem: number of decompositions of 2n into unordered sums of two primes.A045917
From Goldbach problem: number of decompositions of 2n into unordered sums of two primes.
- Describe n. Also called the "Say What You See" or "Look and Say" sequence LS(n).A045918
Describe n. Also called the "Say What You See" or "Look and Say" sequence LS(n).
- Partial sum of Goldbach numbers A045917.A045919
Partial sum of Goldbach numbers A045917.
- Numbers m such that the factorizations of m..m+1 have the same number of primes (including multiplicities).A045920
Numbers m such that the factorizations of m..m+1 have the same number of primes (including multiplicities).
- Erroneous version of A032758.A045921
Erroneous version of A032758.
- Partial sums of Goldbach numbers A002375.A045922
Partial sums of Goldbach numbers A002375.
- Number of irreducible representations of symmetric group S_n for which every matrix has determinant 1.A045923
Number of irreducible representations of symmetric group S_n for which every matrix has determinant 1.
- Numbers n such that prime(n) == -1 (mod n).A045924
Numbers n such that prime(n) == -1 (mod n).
- a(n) = n*Fibonacci(n).A045925
a(n) = n*Fibonacci(n).
- All digits even and nonzero.A045926
All digits even and nonzero.
- Digits even, nonzero and nondecreasing.A045927
Digits even, nonzero and nondecreasing.
- The generalized Connell sequence C_{3,2}.A045928
The generalized Connell sequence C_{3,2}.
- Generalized Connell sequence C_{5,3}.A045929
Generalized Connell sequence C_{5,3}.
- The generalized Connell sequence C_{3,5}.A045930
The generalized Connell sequence C_{3,5}.
- Number of partitions of n with equal number of even and odd parts.A045931
Number of partitions of n with equal number of even and odd parts.
- Numbers n such that n through n+3 are divisible by the same number of distinct primes.A045932
Numbers n such that n through n+3 are divisible by the same number of distinct primes.
- Numbers n such that n through n+4 are divisible by the same number of distinct primes.A045933
Numbers n such that n through n+4 are divisible by the same number of distinct primes.
- Numbers n such that n through n+5 have the same number of distinct prime factors.A045934
Numbers n such that n through n+5 have the same number of distinct prime factors.
- Numbers n such that n through n+6 are divisible by the same number of distinct primes.A045935
Numbers n such that n through n+6 are divisible by the same number of distinct primes.
- Numbers n such that n through n+7 are divisible by the same number of distinct primes.A045936
Numbers n such that n through n+7 are divisible by the same number of distinct primes.
- Numbers n such that n through n+8 are divisible by the same number of distinct primes.A045937
Numbers n such that n through n+8 are divisible by the same number of distinct primes.
- Numbers n such that n through n+9 are divisible by the same number of distinct primes.A045938
Numbers n such that n through n+9 are divisible by the same number of distinct primes.
- Numbers m such that the factorizations of m..m+2 have the same number of primes (including multiplicities).A045939
Numbers m such that the factorizations of m..m+2 have the same number of primes (including multiplicities).
- Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities).A045940
Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities).
- Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities).A045941
Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities).
- Numbers m such that the factorizations of m..m+5 have the same number of primes (including multiplicities).A045942
Numbers m such that the factorizations of m..m+5 have the same number of primes (including multiplicities).
- Triangular matchstick numbers: a(n) = 3*n*(n+1)/2.A045943
Triangular matchstick numbers: a(n) = 3*n*(n+1)/2.
- Rhombic matchstick numbers: a(n) = n*(3*n+2).A045944
Rhombic matchstick numbers: a(n) = n*(3*n+2).
- Hexagonal matchstick numbers: a(n) = 3*n*(3*n+1).A045945
Hexagonal matchstick numbers: a(n) = 3*n*(3*n+1).
- Star of David matchstick numbers: a(n) = 6*n*(3*n+1).A045946
Star of David matchstick numbers: a(n) = 6*n*(3*n+1).
- Triangles in open triangular matchstick arrangement (triangle minus one side) of side n.A045947
Triangles in open triangular matchstick arrangement (triangle minus one side) of side n.
- a(n) = A003418(n)/A034386(n).A045948
a(n) = A003418(n)/A034386(n).
- Number of equilateral triangles formed out of matches that can be found in a hexagonal chunk of side length n in hexagonal array of matchsticks.A045949
Number of equilateral triangles formed out of matches that can be found in a hexagonal chunk of side length n in hexagonal array of matchsticks.
- Number of upward triangles in a Star of David matchstick arrangement of size n.A045950
Number of upward triangles in a Star of David matchstick arrangement of size n.
- Number of solutions to product_A+product_B=product_C where A,B,C is a partition of {1,2,...n}.A045951
Number of solutions to product_A+product_B=product_C where A,B,C is a partition of {1,2,...n}.
- a(n) = 2^(2*n-1)*binomial(2*n,n) + 2^(4*n-1).A045952
a(n) = 2^(2*n-1)*binomial(2*n,n) + 2^(4*n-1).
- Numbers m such that m^2 can be obtained from m by inserting an internal block of (contiguous) digits.A045953
Numbers m such that m^2 can be obtained from m by inserting an internal block of (contiguous) digits.
- Even-Lucky-Numbers: generated by a sieve process like that for Lucky numbers but starting with even numbers.A045954
Even-Lucky-Numbers: generated by a sieve process like that for Lucky numbers but starting with even numbers.
- Twin Even-Lucky-Numbers: lower terms.A045955
Twin Even-Lucky-Numbers: lower terms.
- Twin even-lucky-numbers: upper terms.A045956
Twin even-lucky-numbers: upper terms.
- Twin even-lucky-numbers: middle terms.A045957
Twin even-lucky-numbers: middle terms.
- Numbers k in A045954 such that k+1 is prime.A045958
Numbers k in A045954 such that k+1 is prime.
- Numbers k in A045954 such that k-1 is prime.A045959
Numbers k in A045954 such that k-1 is prime.
- Palindromic even lucky numbers.A045960
Palindromic even lucky numbers.