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.

A145756 a(n) = ((2^prime(n+2)-2)/prime(n+2))/3, where n >= 1.

This page as a plain text file.
%I A145756 #5 Jun 02 2025 00:41:22
%S A145756 2,6,62,210,2570,9198,121574,6170930,23091222,1238188770,17878237850,
%T A145756 68186767614,998138215286,56649051916610,3256840408493918,
%U A145756 12600235023025650,734198769102867726,11085367330679918342
%N A145756 a(n) = ((2^prime(n+2)-2)/prime(n+2))/3, where n >= 1.
%e A145756 For n = 1, a(1) = ((2^prime(1+2)-2)/prime(1+2))/3 = ((2^prime(3)-2)/prime(3))/3 = ((2^5-2)/5)/3 = 30/5/3 = 2
%Y A145756 Equals A064535/3
%K A145756 nonn
%O A145756 1,1
%A A145756 _Vassilis Papadimitriou_, Oct 17 2008