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.

A329935 Numbers k such that k and k+1 are both hoax numbers (A019506).

This page as a plain text file.
%I A329935 #18 Aug 22 2020 18:49:30
%S A329935 84,516,644,860,2325,3344,4188,4980,5268,5484,6259,6603,6692,6980,
%T A329935 7051,7195,8076,8420,9716,10704,11774,12795,12955,12956,13747,14475,
%U A329935 14715,14724,16473,17148,17149,17225,17661,19175,21828,22143,22347,24259,24272,24980
%N A329935 Numbers k such that k and k+1 are both hoax numbers (A019506).
%C A329935 Analogous to A050219 (smaller of Smith brothers) as A019506 (hoax numbers) is analogous to A006753 (Smith numbers).
%H A329935 Amiram Eldar, <a href="/A329935/b329935.txt">Table of n, a(n) for n = 1..10000</a>
%H A329935 Jean-Marie De Koninck, <a href="https://bookstore.ams.org/mbk-64/47">Those Fascinating Numbers</a>, American Mathematical Society, 2009, page 27, entry 85.
%e A329935 84 is in the sequence since 84 is a hoax number: 84 = 2^2 * 3 * 7 and 8 + 4 = 2 + 3 + 7 = 12, and 85 = 84 + 1 is also a hoax number: 85 = 5 * 17 and 8 + 5 = 5 + 1 + 7 = 13.
%t A329935 digitSum[n_]  := Total @ IntegerDigits[n]; hoaxQ[n_] := CompositeQ[n] && Total[ digitSum /@ FactorInteger[n][[;; , 1]] ] == digitSum[n]; seq = {}; isHoax1 = hoaxQ[1]; Do[isHoax2 = hoaxQ[n]; If[isHoax1 && isHoax2, AppendTo[seq, n-1]]; isHoax1 = isHoax2, {n, 2, 25000}]; seq
%Y A329935 Cf. A006753, A019506, A050219, A235766.
%K A329935 nonn,base
%O A329935 1,1
%A A329935 _Amiram Eldar_, Nov 24 2019