192099600

Appears in sequences

• Perfect powers k such that 2*k + 1 is a perfect power; the value of y^b in the solution of the Diophantine equation x^a - 2y^b = 1.at n=6A075114
• Squares of Pell numbers.at n=12A079291
• Squares k such that 2*k+1 is also a square.at n=6A084703
• a(n) = 2*a(n-1) + 2*a(n-3) + a(n-4), with a(0)=1, a(1)=2, a(3)=4, a(4)=10.at n=22A089928
• a(n) = (n!)^2/phi(n!), where phi is Euler's totient function.at n=10A123476
• Square numbers with more divisors than any smaller square number.at n=20A136404
• Duplicate of A136404.at n=20A176471
• Prime encoded sequence of generic integer partitions of n in the antilexicographic order of the partitions.at n=35A182911
• A204512(n)^2 = floor[A055872(n)/8]: Squares such that appending some digit in base 8 yields another square.at n=14A204504
• a(n) is the A106490 index where n first occurs.at n=12A276230
• List of pairs of consecutive integers such that one of them is a square and their sum is also a square.at n=22A331261
• Perfect powers whose totients are factorials.at n=7A335723
• Smallest integer k such that d(k^2)/d(k) = 2n-1, where d(k) is the number of divisors of k.at n=7A339056
• Noninfinitary superabundant numbers: numbers m such that nisigma(m)/m > nisigma(k)/k for all k < m, where nisigma(m) is the sum of noninfinitary divisors of m (A348271).at n=17A348273
• Numbers k achieving record abundance (sigma(k) > 2*k) via a residue-based measure M(k) (see Comments), analogous to superabundant numbers A004394.at n=38A362081
• Numbers that set records in A380032.at n=24A380033