40001

Appears in sequences

• Numbers n with property that n is a substring of its base 5 representation.at n=21A038105
• Truncated square pyramid numbers: a(n) = Sum_{k = n..2*n-1} k^2.at n=26A050410
• Number of 3 X 3 matrices with elements from [0,...,(n-1)] satisfying the condition that the middle element of each row or column is the difference of the two end elements (in absolute value).at n=16A058333
• a(n) = n*10^n + 1.at n=4A064748
• Numbers n such that the digits of P_7(n), the n-th heptagonal number, end in n.at n=35A067271
• Automorphic numbers: numbers k such that k^6 ends with k. Also m-morphic numbers for all m not congruent to 26 (mod 50) but congruent to 6 (mod 10).at n=35A068408
• Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171), with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0.at n=24A071153
• Łukasiewicz words that are also valid asynchronic siteswap juggling patterns.at n=17A071160
• Integers whose decimal expansion satisfies the condition that if we read each term from the left to right (the most significant to the least significant digit) then each nonzero digit gives a distance to the next nonzero digit to right (with a cyclic wrap-over from the least-significant to the most significant nonzero digit).at n=30A071161
• Triangular number index of A077206(n).at n=8A077207
• Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 8.at n=47A136861
• a(n) = 64*n^2 + 1.at n=25A158686
• Composite numbers of the form k*10^k + 1.at n=1A175188
• a(n) = 4*10^n+1.at n=4A199684
• a(n) = 4*n^4 + 1.at n=9A211412
• a(1) = 1; for n > 1: a(n) = smallest odd number greater than a(n-1) which does not use any digit used by a(n-1).at n=31A229364
• Numbers k such that distances from k to three nearest squares are three perfect squares.at n=13A234335
• A239459(n) / n.at n=19A239462
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 169", based on the 5-celled von Neumann neighborhood.at n=40A270463
• Numbers of the form m^2 + 1 that can be expressed in more than one way as j^2 + k^2 with j > k > 1 and gcd(j,k) = 1.at n=24A300166