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.

A104169 Highly decomposable Smith numbers. A Smith number which sets a record for the number of prime factors (counting multiplicity) starting from first Smith number is called a highly decomposable Smith number.

This page as a plain text file.
%I A104169 #24 Mar 27 2025 13:58:01
%S A104169 4,27,378,576,2688,17496,44928,75776,168960,319488,958464,2883584,
%T A104169 5767168,7077888,279969792,544997376,778567680,2579496960,3875536896,
%U A104169 22749904896,60699967488,87509958656,164886478848,199715979264,446676598784,2954937499648
%N A104169 Highly decomposable Smith numbers. A Smith number which sets a record for the number of prime factors (counting multiplicity) starting from first Smith number is called a highly decomposable Smith number.
%C A104169 It is conjectured that except for 27, all highly decomposable Smith numbers are even.
%C A104169 a(27) > 1.286e13. - _Max Alekseyev_, Oct 03 2024
%D A104169 Shyam Sunder Gupta, Smith Numbers, Mathematical Spectrum, 37 (2004/5), 27-29.
%H A104169 Shyam Sunder Gupta, <a href="http://www.shyamsundergupta.com/smith.htm">Smith Numbers</a>.
%H A104169 Shyam Sunder Gupta, <a href="https://doi.org/10.1007/978-981-97-2465-9_4">Smith Numbers</a>, Exploring the Beauty of Fascinating Numbers, Springer (2025), Ch. 4, 127-157.
%F A104169 Number m = A104168(k) in this sequence iff m = min_{n>=k} A104168(n).
%e A104169 a(3) = 378 because the Smith number 378 has 5 prime factors which is > any Smith number < 378.
%Y A104169 Subsequence of A104168.
%Y A104169 Cf. A006753.
%K A104169 nonn,base
%O A104169 1,1
%A A104169 _Shyam Sunder Gupta_, Mar 10 2005 and May 03 2005
%E A104169 a(20)-a(23) from _Donovan Johnson_, Jan 02 2013
%E A104169 a(24)-a(26) from _Max Alekseyev_, Sep 28 2024