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.

A153090 Least k(n) such that k(n)*3^n*(3^n-1)+j is prime with j= -1 or 1 or both.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 14, 5, 5, 5, 1, 7, 6, 5, 7, 12, 1, 5, 1, 6, 29, 23, 20, 8, 6, 6, 9, 2, 10, 18, 19, 13, 57, 1, 1, 9, 10, 8, 5, 8, 8, 26, 5, 5, 6, 39, 41, 6, 9, 50, 6, 32, 6, 4, 8, 2, 79, 28, 23, 33, 78, 31, 35, 19, 32, 46, 7, 6, 116, 39, 7, 20, 6, 35, 8
Offset: 1

Views

Author

Pierre CAMI, Dec 18 2008

Keywords

Comments

Sum_{n=1..k} a(n) / Sum_{n=1..k} n tends to 2*log(3)/7.

Examples

			1*3^1*(3^1-1)-1=5 prime as 7 so k(1)=1 1*3^2*(3^2-1)-1=71 prime as 73 so k(2)=1
		

Crossrefs

Programs

  • Mathematica
    lk[n_]:=Module[{c=3^n (3^n-1),k=1},While[NoneTrue[k*c+{1,-1},PrimeQ],k++];k]; Array[lk,90] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Dec 23 2020 *)

Extensions

Corrected by Harvey P. Dale, Dec 23 2020