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).

Original entry on oeis.org

136, 10974, 96672, 227358, 455334, 527254, 947886
Offset: 1

Views

Author

Paolo P. Lava, Jul 03 2024

Keywords

Comments

No other term up to 10^10. - Giovanni Resta, Jul 06 2024

Examples

			136 is in the sequence as 136 = sigma(36) + sigma(16) + sigma(13) = 91 + 31 + 14. - _David A. Corneth_, Jul 27 2024
		

Crossrefs

Programs

  • Maple
    with(numtheory): P:=proc(q) local a,d,k,i,n,t;
    for n from 1 to q do t:=0; a:=convert(n,base,10);
    for k from 1 to nops(a) do d:=0;
    for i from 1 to nops(a) do if i<> k then d:=d*10+a[-i]; fi; od; t:=sigma(d)+t; od;
    if n=t then print(n); fi; od; end: P(10^6)
  • Mathematica
    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 *)