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.

A090526 Primes arising in A090525, or 0 if A090525(n) = 0.

This page as a plain text file.
%I A090526 #12 Mar 02 2023 06:19:09
%S A090526 2,13,23,347,4241,41177,1677721,9224297,769230769,17831979413,
%T A090526 156422814881,43267872370321,317485909301657,10680338789777057,
%U A090526 348051774975651917,23635436053895336119,230095953656704898101
%N A090526 Primes arising in A090525, or 0 if A090525(n) = 0.
%C A090526 Conjecture: No term is zero.
%C A090526 Conjecture is true: see A090525. - _Robert Israel_, Mar 02 2023
%H A090526 Robert Israel, <a href="/A090526/b090526.txt">Table of n, a(n) for n = 2..386</a>
%F A090526 a(n) = floor(n^n/A090525(n)). - _Robert Israel_, Mar 02 2023
%p A090526 f:= proc(n) local t,k,s;
%p A090526   t:= n^n;
%p A090526   for k from 2 do s:= floor(t/k); if isprime(s) then return s fi od
%p A090526 end proc:
%p A090526 map(f, [$2..100]); # _Robert Israel_, Mar 02 2023
%t A090526 Do[p = n^n; i = 2; While[ !PrimeQ[Floor[p/i]], i++ ]; Print[Floor[p/i]], {n, 2, 30}] (* _Ryan Propper_, Aug 02 2005 *)
%Y A090526 Cf. A090525, A090527, A090528.
%K A090526 nonn
%O A090526 2,1
%A A090526 _Amarnath Murthy_, Dec 07 2003
%E A090526 More terms from _Ryan Propper_, Aug 02 2005
%E A090526 Offset corrected by _Robert Israel_, Mar 02 2023