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.
%I A258884 #33 Jul 26 2017 23:40:24 %S A258884 4199030,29465852,120888092,259858324,260378492,410832532,775397948, %T A258884 785187524,903217276,989226964,1609445332,2358115084,3254323124, %U A258884 3381352084,3381872252,3781448788,3782267372,5056717796,5065605532,5066413508,9210347984,9772585048,9776437996,9843119884 %N A258884 Primitive weird numbers, pwn, of the form 2^k*p*q*r*s with k > 0 and where p < q < r < s are odd primes. %C A258884 This differs from the sequence of primitive weird numbers with 5 (or 4 odd) distinct prime factors from a(54) on, the 54th number of that form being 114141404156 = 2^2 * 13^2 * 19 * 383 * 23203. - _M. F. Hasler_, Jul 08 2016 %H A258884 M. F. Hasler, <a href="/A258884/a258884.txt">Table of n, a(n) for n = 1..60</a> %e A258884 a(1) = 4199030 = 2*5*11*59*647. %e A258884 a(2) = 29465852 = 2^2*13*23*71*347. %e A258884 a(3) = 120888092 = 2^2*13*23*61*1657. %o A258884 (PARI) select(t -> factor(t)[,2][^1]~ == [1,1,1,1], A002975) \\ Assuming that A002975 is defined as vector holding enough terms of that sequence. - _M. F. Hasler_, Jul 08 2016 %Y A258884 Cf. A002975, A258401, A258882, A258883, A258885. %K A258884 nonn %O A258884 1,1 %A A258884 _Douglas E. Iannucci_ and _Robert G. Wilson v_, Jun 14 2015 %E A258884 Definition edited (to require p > 2) by _M. F. Hasler_, Jul 08 2016 %E A258884 Incorrect Mathematica code (allowed 114141404156) removed by _M. F. Hasler_, Jun 29 2016