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 A189055 #20 Jul 29 2023 10:25:36 %S A189055 313968931,6612607849,68618940391,2257404775627,26360313735014491, %T A189055 130898631716248441,11736367906285382977,28945284114821573731, %U A189055 229761141540921525811,202978059247932180748537,228398127589553102936371,476213535986962784582617,1627839264198988265272849,3421374091098795513254497 %N A189055 Primes of the form (k+1)^11 - k^11. %C A189055 All prime numbers which are the difference of integers raised to the 11th power have this form. Values of n in A211184. %H A189055 Vladimir Pletser, <a href="/A189055/b189055.txt">Table of n, a(n) for n = 1..1000</a> %o A189055 (Python) %o A189055 from itertools import count %o A189055 primes = Primes() %o A189055 def diff_pow(i, n): %o A189055 return (i+1)**n - i**n %o A189055 def diff_pow_primes(n, limit=range(1000)): %o A189055 pows = [diff_pow(i, n) for i in limit] %o A189055 return [p for p in pows if p in primes] %o A189055 diff_pow_primes(11, count()) %K A189055 nonn,easy %O A189055 1,1 %A A189055 _David Cushing_, Dec 19 2012