130000

Appears in sequences

• Positive numbers k such that k and 2*k are anagrams in base 5 (written in base 5).at n=19A023061
• Numbers n with property that n is a substring of its base 5 representation.at n=27A038105
• a(1) = 1; string of digits of a(n)^2 is a substring of the string of digits of a(n+1)^2.at n=6A067634
• Erroneous version of A052218.at n=9A094628
• Numbers of the form (10^i)*(13^j), with i, j >= 0.at n=16A108761
• a(n) = n^2*(n^2 - 1)/3.at n=25A112742
• a(n) = 4394*n - 1820.at n=29A156627
• Integers that can be generated with a C/C++ expression that is two or more characters shorter than their decimal representation.at n=12A168651
• Numbers with 50 divisors.at n=29A175756
• a(n) = 1, 7, A011557*(period 6: repeat 10, 13, 31, 49, 70, 97).at n=27A178508
• Numbers with prime factorization pq^4r^4.at n=28A190012
• Nodes of tree generated as follows: (1,2) is an edge, and if (x,y) is an edge, then (y,x*y) and (y,x^2 + y^2) are edges.at n=46A228939
• a(0) = 3; a(n+1) is the smallest number not in the sequence such that a(n+1) - Sum_{i=1..n} a(i) divides a(n+1) - Product_{i=1..n} a(i).at n=26A254344
• Numbers with as many zeros as the sum of their digits.at n=29A354410
• G.f. satisfies A(x) = 1 + x*A(x) + x^6*A(x)^6.at n=18A364523
• a(n) = n^3*sigma_2(n).at n=10A386746