OFFSET
0,2
COMMENTS
An explicit formula for a(n) is not known, although it arises from a recurrence and the corresponding denominators are simply 3^((3^n + 1)/2) = 3*A134799(n).
Next term is too large to include.
LINKS
Paolo Xausa, Table of n, a(n) for n = 0..7
X. Gourdon and P. Sebah, Pythagoras' Constant.
FORMULA
a(n) is the reduced numerator of b(n) = (3/2)*b(n-1)*(1 - b(n-1)^2); b(0) = 1/3.
a(n+1) = a(n)*(3^(3^n+1)-a(n)^2)/2. - Chai Wah Wu, Oct 11 2024
EXAMPLE
MATHEMATICA
Module[{n = 0}, NestList[#*(3^(3^n++ + 1) - #^2)/2 &, 1, 6]] (* Paolo Xausa, Oct 17 2024 *)
PROG
(Python)
from itertools import count, islice
def A376870_gen(): # generator of terms
p = 1
for k in count(0):
yield p
p = p*(3**(3**k+1)-p**2)>>1
CROSSREFS
KEYWORD
nonn,frac,changed
AUTHOR
Steven Finch, Oct 07 2024
STATUS
approved