36517

Appears in sequences

• Numbers k that divide s(k), where s(1)=1, s(j)=13*s(j-1)+j.at n=35A014861
• Pisot sequence P(4,10).at n=10A021004
• Reverse of smallest prime factor of k = largest prime factor of k+1; a(1)=1.at n=30A071392
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k+1 if k <= floor(n/2) otherwise 2*(n-k)+1, and m = 1, read by rows.at n=38A157272
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k+1 if k <= floor(n/2) otherwise 2*(n-k)+1, and m = 1, read by rows.at n=42A157272
• a(n) = 38*n^2 - 1.at n=30A158596
• Integer averages of the first perfect cubes up to some n^3.at n=38A164577
• Period of decimal representation of 1/n^3.at n=52A176921
• Numbers k such that (16*10^k + 167)/3 is prime.at n=22A294227
• a(n) is the maximum value of the quartet index of a bifurcating rooted tree with n leaves.at n=38A300445
• Odd numbers k, not powers of primes, such that sigma(k) == 2 modulo 8 and sigma(sigma(k)) == 6 modulo 8.at n=8A332458
• a(n) is the smallest dividend m of the Euclidean division m = d*n + r such that m/d = r/n.at n=24A335717
• Numbers of the form p^2*q, with odd primes p > q, such that q divides p-1.at n=22A350638
• Numbers k such that k and k+1 are both divisible by the square of their largest prime factor.at n=20A354558
• Numbers k such that sigma(k) = psi(k) + tau(k) + omega(k)^3.at n=14A392263