login
Numbers k such that any two consecutive decimal digits of k^2 differ by 1 after arranging the digits in decreasing order.
4

%I #15 Feb 24 2024 11:08:20

%S 0,1,2,3,18,24,66,74,152,179,3678,3698,4175,4616,5904,5968,6596,7532,

%T 8082,8559,9024,10128,10278,11826,12363,12543,12582,13278,13434,13545,

%U 13698,14442,14676,14766,15681,15963,16854,17529,17778,18072,19023,19377,19569,19629

%N Numbers k such that any two consecutive decimal digits of k^2 differ by 1 after arranging the digits in decreasing order.

%C Numbers k such that k^2 is in A215014. There are 160 terms in this sequence.

%H Michael S. Branicky, <a href="/A370362/b370362.txt">Table of n, a(n) for n = 1..160</a>

%e 18^2 = 324 consists of the consecutive digits 2, 3 and 4;

%e 24^2 = 576 consists of the consecutive digits 5, 6 and 7;

%e 66^2 = 4356 consists of the consecutive digits 3, 4, 5 and 6;

%e 74^2 = 5476 consists of the consecutive digits 4, 5, 6 and 7.

%o (PARI) isconsecutive(m, {b=10})=my(v=vecsort(digits(m, b))); for(i=2, #v, if(v[i]!=1+v[i-1], return(0))); 1 \\ isconsecutive(k, b) == 1 if and only if any two consecutive digits of the base-n expansion of m differ by 1 after arranging the digits in decreasing order

%o a(n) = isconsecutive(n^2)

%o (Python)

%o from math import isqrt

%o from sympy.ntheory import digits

%o def afull(): return([i for i in range(isqrt(10**10)+1) if len(d:=sorted(str(i*i))) == ord(d[-1])-ord(d[0])+1 == len(set(d))])

%o print(afull()) # _Michael S. Branicky_, Feb 23 2024

%Y Cf. A215014, A370370. Supersequence of A156977.

%Y The actual squares are given by A370610.

%K nonn,base,fini,full

%O 1,3

%A _Jianing Song_, Feb 16 2024