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.

A241178 Numbers n such that there are exactly three numbers m with m + (some digit of m) = n.

This page as a plain text file.
%I A241178 #32 Sep 08 2022 08:46:07
%S A241178 14,16,18,20,22,26,28,30,34,38,40,42,44,46,50,52,56,58,62,64,66,68,70,
%T A241178 74,78,80,82,86,88,90,92,94,100,101,103,105,107,110,114,116,118,120,
%U A241178 122,124,136,142,148,152,154,160,162,176,182,184,192,196,198,203,205,207,210,212,214,222,226,228,230,232,234,236
%N A241178 Numbers n such that there are exactly three numbers m with m + (some digit of m) = n.
%C A241178 The numbers 14, 114, 1114, ..., 111...114, ... are terms of the sequence. - _Marius A. Burtea_, Feb 18 2020
%D A241178 Eric Angelini, Posting to Sequence Fans Mailing List, Apr 20 2014.
%H A241178 Robert Israel, <a href="/A241178/b241178.txt">Table of n, a(n) for n = 1..10000</a>
%e A241178 14 = 7 + 7 = 12 + 2 = 13 + 1.
%e A241178 28 = 19 + 9 = 24 + 4 = 26 + 2.
%p A241178 See A241177.
%t A241178 A241178[n_] := Module[{m, c = 0},
%t A241178    Do[c = c + Count[m + Union[IntegerDigits[m]], n], {m, 0, n}]; c];
%t A241178 Select[Range[0, 236], A241178[#] == 3 &] (* _Robert Price_, Mar 20 2019 *)
%o A241178 (Magma) f:=func<n,m|exists(c){a:a in Intseq(m)|m+a eq n }>; [k:k in [11..236]| #[m:m in [1..k]| f(k,m)] eq 3]; // _Marius A. Burtea_, Feb 18 2020
%Y A241178 Related sequences: A241173, A241174, A241175, A241176, A241177, A241178, A241179, A241180, A241181, A241182, A241183.
%K A241178 nonn,base
%O A241178 1,1
%A A241178 _N. J. A. Sloane_, Apr 23 2014