99970

Appears in sequences

• a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 65.at n=4A093265
• Numbers k such that k and k^2 use only the digits 0, 1, 4, 7 and 9.at n=44A136865
• Numbers k such that k and k^2 use only the digits 0, 2, 4, 7 and 9.at n=37A136907
• Numbers k such that k and k^2 use only the digits 0, 3, 4, 7 and 9.at n=19A136934
• Numbers k such that k and k^2 use only the digits 0, 4, 5, 7 and 9.at n=18A136952
• Numbers k such that k and k^2 use only the digits 0, 4, 6, 7 and 9.at n=24A136955
• Numbers k such that k and k^2 use only the digits 0, 4, 7, 8 and 9.at n=40A136959
• Numbers k such that k and k^2 use only the digits 0, 4, 7 and 9.at n=14A136960
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (0, 1, -1), (1, 0, 1)}.at n=11A148775
• Constant term in the reduction of the n-th Fibonacci polynomial by x^3->x^2+x+1. See Comments.at n=17A192616