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.

A225492 Least numbers k for each base b >= 2 such that N = b^(2^n) + k is prime for 6 consecutive values from n = 0 to n = 5.

This page as a plain text file.
%I A225492 #7 Jun 02 2025 08:34:18
%S A225492 15,440,93,1518,1081,8712,52305,32300,5383,8058,7165,196168,405,11456,
%T A225492 81,66432,102745,88848,1071,15206,8607,12228,270185,57668,56895,42322,
%U A225492 339835,120510,3089
%N A225492 Least numbers k for each base  b >= 2 such that N = b^(2^n) + k is prime for 6  consecutive values from  n = 0 to  n = 5.
%K A225492 nonn
%O A225492 2,1
%A A225492 _Robin Garcia_, May 08 2013