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.

A241793 Least number k such that k^n and k^n-1 contain the same number of prime factors (counted with multiplicity) or 0 if no such k exists.

This page as a plain text file.
%I A241793 #39 Sep 26 2018 10:09:01
%S A241793 3,34,5,15,17,55,79,5,53,23,337,13,601,79,241,41,18433,31,40961,89,
%T A241793 3313,1153
%N A241793 Least number k such that k^n and k^n-1 contain the same number of prime factors (counted with multiplicity) or 0 if no such k exists.
%C A241793 a(23) > 3250.
%C A241793 a(24) = 79. - _Jacques Tramu_, Sep 16 2018
%C A241793 100000 < a(23) <= 286721. - _Jon E. Schoenfield_, Sep 25 2018
%e A241793 2^1 (2) and 2^1-1 (1) do not have the same number of prime factors. 3^1 (3) and 3^1-1 (2) have the same number of prime factors. Thus a(1) = 3.
%o A241793 (PARI) a(n)=for(k=2,oo,if(bigomega(k^n)==bigomega(k^n-1),return(k)));
%Y A241793 Cf. A001222 (bigomega), A242786.
%K A241793 nonn,more,hard
%O A241793 1,1
%A A241793 _Derek Orr_, May 23 2014
%E A241793 a(17) and a(19) corrected by _Jacques Tramu_, Sep 16 2018