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 A104094 #16 Apr 21 2024 16:08:20 %S A104094 7,79,727,6553,59029,531383,4782961,43046623,387420479,3486784393, %T A104094 31381059607,282429536453,2541865828309,22876792454939, %U A104094 205891132094623,1853020188851807,16677181699666513,150094635296999111 %N A104094 Largest prime <= 9^n. %H A104094 Robert Israel, <a href="/A104094/b104094.txt">Table of n, a(n) for n = 1..1046</a> %F A104094 a(n) = 9^n - A013604(2*n) = A001019(n) - A013604(2*n), n > 0. _A.H.M. Smeets_, Aug 12 2019 %p A104094 f:= n -> prevprime(9^n): %p A104094 map(f, [$1..30]); # _Robert Israel_, Aug 12 2019 %t A104094 NextPrime[#,-1]&/@(9^Range[20]) (* _Harvey P. Dale_, Apr 21 2024 *) %o A104094 (PARI) g(n,b) = for(x=0,n,print1(precprime(b^x)",")) %Y A104094 Cf. A013604. %Y A104094 Largest prime <= b^n: 2^n-A013603(n), 3^n-A013604(n), 4^n-A013606(n), 5^n-A013605(n), 6^n-A013607(n), 7^n-A013608(n), 8^n-A013603(3*n), 10^n-A033874(n). %K A104094 easy,nonn %O A104094 1,1 %A A104094 _Cino Hilliard_, Mar 03 2005