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.

A281907 Numbers congruent to 47867742232066880047611079 modulo 66483034025018711639862527490.

This page as a plain text file.
%I A281907 #14 Sep 19 2020 23:55:06
%S A281907 47867742232066880047611079,66530901767250778519910138569,
%T A281907 133013935792269490159772666059,199496969817288201799635193549,
%U A281907 265980003842306913439497721039,332463037867325625079360248529,398946071892344336719222776019,465429105917363048359085303509
%N A281907 Numbers congruent to 47867742232066880047611079 modulo 66483034025018711639862527490.
%C A281907 The terms of this sequence cannot be written as +-p^a +-q^b with p, q prime and a, b nonnegative integers for any possible choice of signs (cf. Theorem in Sun, 2000).
%C A281907 47867742232066880047611079 is a Brier number (A076335). - _Jeppe Stig Nielsen_, Sep 16 2020
%H A281907 Fred Cohen and J. L. Selfridge, <a href="https://doi.org/10.1090/S0025-5718-1975-0376583-0">Not every number is the sum or difference of two prime powers</a>, Math. Comp. 29 (1975), 79-81.
%H A281907 Zhi-Wei Sun, <a href="https://doi.org/10.1090/S0002-9939-99-05502-1">On integers not of the form +-p^a+-q^b</a>, Proceedings of the American Mathematical Society, Vol. 128, No. 4 (2000), 997-1002.
%F A281907 a(n) = 66483034025018711639862527490*n + 47867742232066880047611079.
%t A281907 Table[66483034025018711639862527490 n + 47867742232066880047611079, {n, 0, 7}] (* _Michael De Vlieger_, Feb 02 2017 *)
%o A281907 (PARI) a(n) = 66483034025018711639862527490*n+47867742232066880047611079
%Y A281907 Cf. A153352.
%K A281907 nonn,easy
%O A281907 1,1
%A A281907 _Felix Fröhlich_, Feb 01 2017