A255851 Number of n-digit squares which remain squares if every digit is decreased by 1 (cf. A061844).
1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 0, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 34, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0
Offset: 1
Links
- Lars Blomberg, Table of n, a(n) for n = 1..180
Programs
-
PARI
a(n,A=A255850)=sum(i=1,#A,A[i]==n)
Extensions
Corrected a(30) and more terms calculated from A061844 by Lars Blomberg, Aug 21 2016
Comments