Sequences
392,541 sequences
- Multiples of 3 with all even digits.A061811
Multiples of 3 with all even digits.
- Numbers k such that floor(Pi*k) is a square.A061812
Numbers k such that floor(Pi*k) is a square.
- When cubed gives number composed just of the digits 1, 2, 3, 4, 5.A061813
When cubed gives number composed just of the digits 1, 2, 3, 4, 5.
- Multiples of 4 containing only even digits.A061814
Multiples of 4 containing only even digits.
- G.f. A(x) satisfies A(x) = 1+Sum_{j=0 to infinity} ((1 + x^(j+1)*A(x))^a_j-1).A061815
G.f. A(x) satisfies A(x) = 1+Sum_{j=0 to infinity} ((1 + x^(j+1)*A(x))^a_j-1).
- Obtain m by omitting trailing zeros from n (cf. A004151); a(n) = smallest multiple k*m which is a palindrome.A061816
Obtain m by omitting trailing zeros from n (cf. A004151); a(n) = smallest multiple k*m which is a palindrome.
- Multiples of 9 containing only odd digits.A061817
Multiples of 9 containing only odd digits.
- Multiples of 2 containing only digits 0,1,2.A061818
Multiples of 2 containing only digits 0,1,2.
- Multiples of 3 containing only digits 0,1,2,3.A061819
Multiples of 3 containing only digits 0,1,2,3.
- Multiples of 4 containing only digits 0,...,4.A061820
Multiples of 4 containing only digits 0,...,4.
- Multiples of 5 containing only digits 0,...,5.A061821
Multiples of 5 containing only digits 0,...,5.
- Multiples of 6 containing only digits 0,...,6.A061822
Multiples of 6 containing only digits 0,...,6.
- Multiples of 7 containing only digits 0,...,7.A061823
Multiples of 7 containing only digits 0,...,7.
- Multiples of 8 containing only the digits 0, ..., 8.A061824
Multiples of 8 containing only the digits 0, ..., 8.
- Multiples of 7 containing only odd digits.A061825
Multiples of 7 containing only odd digits.
- Multiples of 7 containing only even digits.A061826
Multiples of 7 containing only even digits.
- Number of partitions of n into parts which are the digits of n.A061827
Number of partitions of n into parts which are the digits of n.
- Number of partitions of n into parts using the digits of n.A061828
Number of partitions of n into parts using the digits of n.
- Multiples of 5 having only odd digits.A061829
Multiples of 5 having only odd digits.
- Multiples of 5 having only even digits.A061830
Multiples of 5 having only even digits.
- Multiples of 9 having only even digits.A061831
Multiples of 9 having only even digits.
- Multiples of 11 having only even digits.A061832
Multiples of 11 having only even digits.
- Multiples of 11 having only odd digits.A061833
Multiples of 11 having only odd digits.
- a(n) = binomial(n,2) * !n.A061834
a(n) = binomial(n,2) * !n.
- a(1) = 5; a(n) = smallest power of 5 (larger than a(n-1)) with a(n-1) forming its final digits.A061835
a(1) = 5; a(n) = smallest power of 5 (larger than a(n-1)) with a(n-1) forming its final digits.
- a(n) = smallest k>0 such that k+n divides k!.A061836
a(n) = smallest k>0 such that k+n divides k!.
- Numbers k such that (k+2)^2 | k!.A061837
Numbers k such that (k+2)^2 | k!.
- Numbers k such that (k+3)^3 | k!.A061838
Numbers k such that (k+3)^3 | k!.
- a(n+1) is the smallest square ending with a(n), initial term is 5.A061839
a(n+1) is the smallest square ending with a(n), initial term is 5.
- Numbers k such that (k+4)^4 | k!.A061840
Numbers k such that (k+4)^4 | k!.
- Numbers k such that (k+5)^5 | k!.A061841
Numbers k such that (k+5)^5 | k!.
- Numbers k such that (k+6)^6 | k!.A061842
Numbers k such that (k+6)^6 | k!.
- Squares which remain squares if you increment every digit by 1.A061843
Squares which remain squares if you increment every digit by 1.
- Squares that remain squares if you decrease every digit by 1.A061844
Squares that remain squares if you decrease every digit by 1.
- Numbers that have one of every digit in some base.A061845
Numbers that have one of every digit in some base.
- Number of nonisomorphic circulant self-complementary undirected p^2-graphs, indexed by odd primes p.A061846
Number of nonisomorphic circulant self-complementary undirected p^2-graphs, indexed by odd primes p.
- Circulant self-complementary undirected p^2-graphs up to rotations only, indexed by odd primes p.A061847
Circulant self-complementary undirected p^2-graphs up to rotations only, indexed by odd primes p.
- An intermediate sequence for nonisomorphic circulant self-complementary undirected p^2-graphs, indexed by odd primes p.A061848
An intermediate sequence for nonisomorphic circulant self-complementary undirected p^2-graphs, indexed by odd primes p.
- Non-Cayley-isomorphic circulant self-complementary undirected p^2-graphs, indexed by odd primes p.A061849
Non-Cayley-isomorphic circulant self-complementary undirected p^2-graphs, indexed by odd primes p.
- Squares whose consecutive digits vary by at most 1.A061850
Squares whose consecutive digits vary by at most 1.
- Digital representation of n contains only 1's and 0's, is palindromic and contains no singleton 1's or 0's.A061851
Digital representation of n contains only 1's and 0's, is palindromic and contains no singleton 1's or 0's.
- Digital representation of m contains only either 1's or 2's (but not both 1's and 2's) and 0's, is palindromic and contains no singleton 2's, 1's or 0's.A061852
Digital representation of m contains only either 1's or 2's (but not both 1's and 2's) and 0's, is palindromic and contains no singleton 2's, 1's or 0's.
- Difference between smallest prime not dividing n and smallest nondivisor of n.A061853
Difference between smallest prime not dividing n and smallest nondivisor of n.
- Nondiving binary sequences: numbers which in base 2 have at least the same number of 1's as 0's and reading the binary expansion from left (msb) to right (least significant bit), the number of 0's never exceeds the number of 1's.A061854
Nondiving binary sequences: numbers which in base 2 have at least the same number of 1's as 0's and reading the binary expansion from left (msb) to right (least significant bit), the number of 0's never exceeds the number of 1's.
- Symmetric totally balanced binary sequences: those terms of A014486 which are equal to their reversed complement.A061855
Symmetric totally balanced binary sequences: those terms of A014486 which are equal to their reversed complement.
- The positions of the terms of A061855 in the sequence A014486, terms fixed by the permutation A057164.A061856
The positions of the terms of A061855 in the sequence A014486, terms fixed by the permutation A057164.
- Triangle in which the k-th item in the n-th row (both starting from 1) is the number of ways in which we can add 2 distinct integers from 1 to n in such a way that the sum is divisible by k.A061857
Triangle in which the k-th item in the n-th row (both starting from 1) is the number of ways in which we can add 2 distinct integers from 1 to n in such a way that the sum is divisible by k.
- Differences between the ordinary multiplication table A004247 and the carryless multiplication table for GF(2)[X] polynomials A048720, i.e., the effect of the carry bits in binary multiplication.A061858
Differences between the ordinary multiplication table A004247 and the carryless multiplication table for GF(2)[X] polynomials A048720, i.e., the effect of the carry bits in binary multiplication.
- Differences between the ordinary multiplication table A004247 and Xmult table A048720, computed for {3..n} * {3..n}.A061859
Differences between the ordinary multiplication table A004247 and Xmult table A048720, computed for {3..n} * {3..n}.
- Variant of A061417.A061860
Variant of A061417.