53946

Appears in sequences

• Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (2,2,2).at n=4A005548
• Reverse of largest prime factor of n = smallest prime factor of n+1; a(1)=1.at n=31A071393
• a(n) = (2*n^3 + 5*n^2 - 7*n)/2.at n=36A162261
• a(n) is the smallest even k >= 2 such that the first n multiples of k have the same sum of digits, but (n + 1)*k has a different one. a(n) = 0 if no such k exists.at n=36A237994
• a(n) is the smallest k > 0 such that the first n multiples of k have the same sum of digits, but (n+1)k has a different one. a(n)=0 if no such k exists.at n=36A238088