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.

A157496 Composite numbers n where the largest digit m is equal to the sum of all digits of n except for one occurrence of m.

This page as a plain text file.
%I A157496 #10 Sep 08 2022 08:45:42
%S A157496 22,33,44,55,66,77,88,99,110,112,121,123,132,134,143,145,154,156,165,
%T A157496 176,178,187,189,198,202,213,220,224,231,235,242,246,253,264,268,275,
%U A157496 279,286,297,303,312,314,321,325,330,336,341,352,358,363,369,374,385
%N A157496 Composite numbers n where the largest digit m is equal to the sum of all digits of n except for one occurrence of m.
%e A157496 341 is a composite number where the largest digit is the sum of all the other digits.
%e A157496 330 is composite and has largest digit 3, which equals the sum of all digits of 330 except for one occurrence of 3, viz. 3+0.
%o A157496 (Magma) [ n: n in [2..390] | not IsPrime(n) and m eq &+S - m where m is Max(S) where S is Intseq(n, 10) ]; // _Klaus Brockhaus_, Apr 12 2009
%Y A157496 Cf. A002808 (composite numbers).
%K A157496 nonn,base,less
%O A157496 1,1
%A A157496 _Parthasarathy Nambi_, Mar 01 2009
%E A157496 Entry revised by _N. J. A. Sloane_, Mar 27 2009
%E A157496 0 removed, 110 and 330 inserted, extended, definition clarified, second example and keyword less added by _Klaus Brockhaus_, Apr 12 2009