login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A281907 Numbers congruent to 47867742232066880047611079 modulo 66483034025018711639862527490. 0

%I #14 Sep 19 2020 23:55:06

%S 47867742232066880047611079,66530901767250778519910138569,

%T 133013935792269490159772666059,199496969817288201799635193549,

%U 265980003842306913439497721039,332463037867325625079360248529,398946071892344336719222776019,465429105917363048359085303509

%N Numbers congruent to 47867742232066880047611079 modulo 66483034025018711639862527490.

%C 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 47867742232066880047611079 is a Brier number (A076335). - _Jeppe Stig Nielsen_, Sep 16 2020

%H 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 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 a(n) = 66483034025018711639862527490*n + 47867742232066880047611079.

%t Table[66483034025018711639862527490 n + 47867742232066880047611079, {n, 0, 7}] (* _Michael De Vlieger_, Feb 02 2017 *)

%o (PARI) a(n) = 66483034025018711639862527490*n+47867742232066880047611079

%Y Cf. A153352.

%K nonn,easy

%O 1,1

%A _Felix Fröhlich_, Feb 01 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)