40004
domain: N
Appears in sequences
- Palindromes whose digits do not appear in previous term.at n=39A030285
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 100.at n=3A031778
- Numbers n with property that n is a substring of its base 5 representation.at n=24A038105
- Palindromes that start with 4.at n=22A043039
- Palindromes in A085934.at n=39A085935
- Beginning with 1 palindromes with prime successive differences.at n=27A088049
- Numbers n such that there are (presumably) ten palindromes in the Reverse and Add! trajectory of n.at n=5A090071
- Palindromes with either no internal digits or all internal digits are 0.at n=40A109882
- Numbers k such that the k-th triangular number contains only digits {0,1,8}.at n=13A119046
- Positive integers n such that the sum of the squares of all the substring decompositions of n is a multiple of n.at n=30A154562
- Numbers n whose cubes are concatenations n^3 = x//y such that x is an anagram of y.at n=11A162946
- The number of permutations of length n that can be sorted by 5 pop stacks in parallel.at n=8A164873
- Numbers whose decimal expansion contains only 0's and 4's.at n=17A169967
- Numbers such that each digit is the sum of two or more other digits.at n=12A203591
- Palindromes for which both the numerator (A017665) and the denominator (A017666) of sigma(n)/n are palindromes, where sigma is the sum of divisors (A000203).at n=9A240466
- Irregular triangular array: row n lists the numbers D, each being the discriminant of the minimal polynomial of a quadratic irrational represented by a continued fraction with period an n-tuple of 1s and 2s.at n=51A246903
- Palindromes of the form i^2 + reverse(i)^2.at n=13A256398
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + n, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=17A294552
- Numbers with decimal expansion d_1, ..., d_w such that for any k in 1..w there is some m in 1..w such that d_k = d_m = abs(k - m).at n=28A336880
- Number of ways to partition digits 0-9 into signed terms in decreasing absolute value order with sum n.at n=12A389952