833569

Appears in sequences

• Define sds(n) = sum of the squares of the digits of n. Sequence gives smaller of two consecutive squares with sds(k^2) = sds((k+1)^2).at n=7A069645
• Squares which when subtracted from their reverse form nonzero squares.at n=7A152071
• Smaller of two consecutive squares which are anagrams (permutations) of each other.at n=2A227692
• Squares s such that s + 1234567890 is prime.at n=32A241538
• Number of (n+1) X (3+1) arrays of permutations of 0..n*4+3 with each element having index change (+-,+-) 0,0 1,2 or 1,0.at n=3A264000
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change (+-,+-) 0,0 1,2 or 1,0.at n=18A264003
• Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having index change (+-,+-) 0,0 1,2 or 1,0.at n=2A264007
• a(n) = Sum_{k=1..n} k^2 * floor(n/k)^n.at n=6A350125