49725

Appears in sequences

• Reverse and add (in binary) - written in base 10.at n=22A035522
• A diagonal of A008296.at n=24A059302
• Trajectory of 22 under the Reverse and Add! operation carried out in base 2.at n=21A061561
• a(n) = n*(n - 1)*(n^2 + 1)/2.at n=18A071252
• A certain partition array in Abramowitz-Stegun order (A-St order), called M_3(5)/M_3.at n=31A134274
• a(n) = (8*n+5)*(8*n+9).at n=27A146302
• a(n) = 6*a(n-1)-8*a(n-2)-9 for n > 2; a(0) = 35, a(1) = 225, a(2) = 837.at n=5A171471
• Trajectory of 26 under the Reverse and Add! operation carried out in base 2.at n=19A213012
• a(n) = Sum_{i=1..n} (3i)^2.at n=25A220443
• a(n) = 9*binomial(11*n+9,n)/(11*n+9).at n=4A235339
• a(n) = n*(n + 1)*(19*n - 16)/6.at n=25A237618
• Triangle T read by rows: T(n, m), for n >= 2, and m=1, 2, ..., n-1, equals the positive integer solution x of y^2 = x^3 - A(n, m)^2*x with the area A(n, m) = A249869(n, m) of the primitive Pythagorean triangle characterized by (n, m) or 0 if no such triangle exists.at n=92A278711
• Numbers k such that 32771*2^k + 1 is prime.at n=37A281483
• a(n) is the position of the first occurrence of n^3 in the concatenation of the positive integers in decimal representation.at n=22A290787
• a(n) is the smallest number that has exactly n evil divisors (A001969).at n=29A356019
• Numbers that are divisible by the squares of two distinct primes and whose arithmetic derivative (A003415) is a squarefree number of the form 4k+2.at n=11A368697
• Numbers k such that A372692(k) = A372692(k+1) > 1.at n=9A372693
• Number of compositions of 7*n-2 into parts 6 and 7.at n=16A373934
• a(n) = sigma_2(n) * sigma_3(n).at n=7A379814
• a(n) = Sum_{k=0..floor(n/2)} binomial(k,3*(n-2*k)).at n=39A392253