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.

A303660 Number of ways to write 2*n+1 as p + 3^k + 5^m, where p is a prime, and k and m are nonnegative integers.

Original entry on oeis.org

0, 1, 2, 3, 3, 4, 4, 4, 4, 5, 3, 4, 4, 3, 6, 7, 5, 6, 8, 5, 5, 9, 6, 5, 8, 3, 6, 8, 4, 4, 7, 6, 4, 8, 6, 5, 9, 4, 4, 8, 3, 6, 8, 7, 4, 9, 6, 4, 9, 5, 5, 9, 6, 6, 11, 7, 7, 9, 5, 3, 8, 5, 3, 9, 7, 7, 11, 8, 8, 12
Offset: 1

Views

Author

Zhi-Wei Sun, Apr 28 2018

Keywords

Comments

Note that a(21323543) = 0, i.e., the odd number 2*21323543 + 1 = 42647087 cannot be written as the sum of a prime, a power of 3 and a power of 5.

Examples

			a(2) = 1 since 2*2+1 = 3 + 3^0 + 5^0 with 3 prime.
a(3) = 2 since 2*3+1 = 3 + 3^1 + 5^0 = 5 + 3^0 + 5^0 with 3 and 5 prime.
		

Crossrefs

Programs

  • Mathematica
    tab={};Do[r=0;Do[If[PrimeQ[2n+1-5^x-3^y],r=r+1],{x,0,Log[5,2n]},{y,0,Log[3,2n+1-5^x]}];tab=Append[tab,r],{n,1,70}];Print[tab]