|
|
A114258
|
|
Numbers k such that k^2 contains exactly 2 copies of each digit of k.
|
|
18
|
|
|
72576, 406512, 415278, 494462, 603297, 725760, 3279015, 4065120, 4152780, 4651328, 4915278, 4927203, 4944620, 4972826, 4974032, 4985523, 4989323, 5002245, 5016125, 6032970, 6214358, 6415002, 6524235, 7257600, 9883667
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
If k is a term, then k == 0 (mod 9) or k == 2 (mod 9) (see A370676).
First decimal digit of each term is 3 or larger. (End)
|
|
LINKS
|
|
|
EXAMPLE
|
72576 is in the sequence since its square 5267275776 contains four 7's, two 2's, two 5's and two 6's.
|
|
PROG
|
(Python)
from math import isqrt
from itertools import count, islice
def A114258_gen(): # generator of terms
for l in count(1):
a = isqrt(10**((l<<1)-1))
if (a9:=a%9):
a -= a9
for b in range(a, 10**l, 9):
for c in (0, 2):
k = b+c
if sorted(str(k)*2)==sorted(str(k**2)):
yield k
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|