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.

A105648 Smallest member of a set of Smith triples.

This page as a plain text file.
%I A105648 #16 Dec 05 2022 04:42:12
%S A105648 73615,209065,225951,283745,305455,342879,656743,683670,729066,747948,
%T A105648 774858,879221,954590,1185547,1262722,1353955,1369374,1495718,1622495,
%U A105648 1666434,1790480,2197579,2299772,2428854,2561678,2576441,2580367,2636516,2665480,2707580,2741816
%N A105648 Smallest member of a set of Smith triples.
%C A105648 If there are 3 consecutive numbers which are Smith numbers, these can be called a Smith triple.
%H A105648 Amiram Eldar, <a href="/A105648/b105648.txt">Table of n, a(n) for n = 1..10000</a>
%H A105648 S. S. Gupta, <a href="http://www.shyamsundergupta.com/smith.htm">Smith Numbers</a>.
%e A105648 a(1) = 73615 because 73615 is the smallest of 3 consecutive integers which are Smith numbers, i.e., the three consecutive numbers 73615, 73616, 73617 are all Smith numbers.
%t A105648 digSum[n_] := Plus @@ IntegerDigits[n]; smithQ[n_] := CompositeQ[n] && Plus @@ (Last@#*digSum[First@#] & /@ FactorInteger[n]) == digSum[n]; sm = smithQ /@ Range[3]; seq = {}; Do[sm = Join[Rest[sm], {smithQ[k]}]; If[And @@ sm, AppendTo[seq, k - 2]], {k, 4, 10^6}]; seq (* _Amiram Eldar_, Aug 18 2020 *)
%Y A105648 Cf. A006753, A050219, A059754, A105649, A105650.
%K A105648 nonn,base
%O A105648 1,1
%A A105648 _Shyam Sunder Gupta_, May 03 2005
%E A105648 More terms from _Amiram Eldar_, Aug 18 2020