OFFSET
1,2
COMMENTS
This is a finite sequence since if k is L digits long then its sum of digits is at most 9*L which is < L^2 for L > 9.
LINKS
Anwar Hahj Jefferson-George, Table of n, a(n) for n = 1..74583
MATHEMATICA
Select[Range[1200], DigitSum[#]==IntegerLength[#]^2&] (* James C. McMahon, Feb 18 2025 *)
PROG
(Rust)
/// Is the term a valid entry in a380725
pub fn a380725_predicate(mut k: usize) -> bool {
let base = 10usize;
let mut len = 0usize;
let mut digit_sum = 0usize;
while k > 0 {
let digit = k.rem_euclid(base);
k /= base;
digit_sum += digit;
len += 1;
}
digit_sum == len.pow(2u32)
}
(PARI) isok(k) = my(d=digits(k)); vecsum(d) == sqr(#d); \\ Michel Marcus, Feb 08 2025
(Python)
def ok(n): return sum(map(int, s:=str(n))) == len(s)**2
print([k for k in range(2000) if ok(k)]) # Michael S. Branicky, Feb 08 2025
CROSSREFS
KEYWORD
nonn,base,fini,full,easy,new
AUTHOR
Anwar Hahj Jefferson-George, Jan 30 2025
STATUS
approved