cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A374308 Integers m, with k digits, such that m = Sum_{i=1..k} A000203(m without its i-th digit).

This page as a plain text file.
%I A374308 #23 Jul 28 2024 00:09:45
%S A374308 136,10974,96672,227358,455334,527254,947886
%N A374308 Integers m, with k digits, such that m = Sum_{i=1..k} A000203(m without its i-th digit).
%C A374308 No other term up to 10^10. - _Giovanni Resta_, Jul 06 2024
%e A374308 136 is in the sequence as 136 = sigma(36) + sigma(16) + sigma(13) = 91 + 31 + 14. - _David A. Corneth_, Jul 27 2024
%p A374308 with(numtheory): P:=proc(q) local a,d,k,i,n,t;
%p A374308 for n from 1 to q do t:=0; a:=convert(n,base,10);
%p A374308 for k from 1 to nops(a) do d:=0;
%p A374308 for i from 1 to nops(a) do if i<> k then d:=d*10+a[-i]; fi; od; t:=sigma(d)+t; od;
%p A374308 if n=t then print(n); fi; od; end: P(10^6)
%t A374308 q[n_] := Module[{d = IntegerDigits[n]}, n == Total[DivisorSigma[1, Map[FromDigits, Delete[d, #] & /@ Range[Length[d]]]]]]; Select[Range[10^6], q] (* _Amiram Eldar_, Jul 27 2024 *)
%Y A374308 Cf. A000203, A372753, A374309, A374368.
%K A374308 nonn,base,more
%O A374308 1,1
%A A374308 _Paolo P. Lava_, Jul 03 2024