A116603 -id:A116603 - cp's OEIS frontend

A112302 Decimal expansion of quadratic recurrence constant sqrt(1 * sqrt(2 * sqrt(3 * sqrt(4 * ...)))).

1, 6, 6, 1, 6, 8, 7, 9, 4, 9, 6, 3, 3, 5, 9, 4, 1, 2, 1, 2, 9, 5, 8, 1, 8, 9, 2, 2, 7, 4, 9, 9, 5, 0, 7, 4, 9, 9, 6, 4, 4, 1, 8, 6, 3, 5, 0, 2, 5, 0, 6, 8, 2, 0, 8, 1, 8, 9, 7, 1, 1, 1, 6, 8, 0, 2, 5, 6, 0, 9, 0, 2, 9, 8, 2, 6, 3, 8, 3, 7, 2, 7, 9, 0, 8, 3, 6, 9, 1, 7, 6, 4, 1, 1, 4, 6, 1, 1, 6, 7, 1, 5, 5, 2, 8

Offset: 1

Michael Somos, Sep 02 2005

From Johannes W. Meijer, Jun 27 2016: (Start)
With Phi(z, p, q) the Lerch transcendent, define LP(n) = (1/n) * sum(Phi(1/2, n-k, 1) * LP(k), k=0..n-1), with LP(0) = 1. Conjecture: Lim_{n -> infinity} LP(n) = A112302.
For similar formulas, see A090998 and A135002. For background information, see A274181.
The structure of the n! * LP(n) formulas leads to the multinomial coefficients A036039. (End)

			1.6616879496335941212958189227499507499644186350250682081897111680...

S. R. Finch, Mathematical Constants, Cambridge University Press, Cambridge, 2003, p. 446.
S. Ramanujan, Collected Papers, Ed. G. H. Hardy et al., AMS Chelsea 2000. See Appendix I. p. 348.

Robert G. Wilson v, Table of n, a(n) for n = 1..1011
Steven Finch, Errata and Addenda to Mathematical Constants, arXiv:2001.00578 [math.HO], 2020, Section 6.10.
Hibiki Gima, Toshiki Matsusaka, Taichi Miyazaki, and Shunta Yara, On integrality and asymptotic behavior of the (k,l)-Göbel sequences, arXiv:2402.09064 [math.NT], 2024. See p. 2.
Olivier Golinelli, Remote control system of a binary tree of switches - II. balancing for a perfect binary tree, arXiv:2405.16968 [cs.DM], 2024. See p. 17.
M. D. Hirschhorn, A note on Somos' quadratic recurrence constant, J. Number Theory 131 (2011), 2061-2063.
Dawei Lu and Zexi Song, Some new continued fraction estimates of the Somos' quadratic recurrence constant, Journal of Number Theory, 155 (2015), 36-45.
Dawei Lu, Xiaoguang Wang, and Ruiqing Xu, Some New Exponential-Function Estimates of the Somos' Quadratic Recurrence Constant, Results in Mathematics 74(1) (2019), Article 6.
Cristinel Mortici, Estimating the Somos' quadratic recurrence constant, J. Number Theory 130 (2010), 2650-1657.
Jesús Guillera and Jonathan Sondow, Double integrals and infinite products for some classical constants via analytic continuations of Lerch's transcendent, arXiv:math/0506319 [math.NT], 2005-2006; see page 8.
Jesús Guillera and Jonathan Sondow, Double integrals and infinite products for some classical constants via analytic continuations of Lerch's transcendent, Ramanujan J. 16 (2008), 247-270.
Jörg Neunhäuserer, On the universality of Somos' constant, arXiv:2006.02882 [math.DS], 2020.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, arXiv:math/0610499 [math.CA], 2006.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, J. Math. Anal. Appl. 332 (2007), 292-314.
Eric Weisstein's World of Mathematics, Somos's Quadratic Recurrence Constant.
Wikipedia, Somos' quadratic recurrence constant
Xu You and Di-Rong Chen, Improved continued fraction sequence convergent to the Somos' quadratic recurrence constant, Mathematical Analysis and Applications, 436(1) (2016), 513-520.

Cf. A052129, A055209, A116603, A123851, A123852, A123853, A123854.
Cf. A114124 (log).
Cf. A036039, A090998, A135002, A188834, A259235, A274181.

RealDigits[ Fold[ N[ Sqrt[ #2*#1], 128] &, Sqrt@ 351, Reverse@ Range@ 350], 10, 111][[1]] (* Robert G. Wilson v, Nov 05 2010 *)
Exp[-Derivative[1, 0][PolyLog][0, 1/2]] // RealDigits[#, 10, 105]& // First (* Jean-François Alcover, Apr 07 2014, after Jonathan Sondow *)

{a(n) = if( n<-1, 0, n++; default( realprecision, n+2); floor( prodinf( k=1, k^2^-k)* 10^n) % 10)};

prodinf(n=1,n^2^-n) \\ Charles R Greathouse IV, Apr 07 2013

from mpmath import polylog, diff, exp, mp
mp.dps = 120
somos_const = exp(-diff(lambda n: polylog(n, 1/2), 0))
A112302 = [int(d) for d in mp.nstr(somos_const, n=mp.dps)[:-1] if d != '.']  # Jwalin Bhatt, Nov 23 2024

Equals Product_{n>=1} n^(1/2^n). - Jonathan Sondow, Apr 07 2013
Equals exp(A114124) = A188834/2 = sqrt(A259235). - Hugo Pfoertner, Nov 23 2024
From Jwalin Bhatt, Apr 02 2025: (Start)
Equals exp(-PolyLog'(0,1/2)), where PolyLog'(x,y) represents the derivative of the polylogarithm w.r.t. x.
Equals Product_{n>=1} (1+1/n)^(1/2^n).
Equals exp(Sum_{n>=2} log(n)/2^n).
Equals 2*exp(Sum_{n>=1} (log(1+1/n)-1/n)/2^n). (End)

A052129 a(0) = 1; thereafter a(n) = n*a(n-1)^2.

Original entry on oeis.org

1, 1, 2, 12, 576, 1658880, 16511297126400, 1908360529573854283038720000, 29134719286683212541013468732221146917416153907200000000

Offset: 0

Reinhard Zumkeller, Feb 12 2002

Somos's quadratic recurrence sequence.
Iff n is prime (n>2), the n-adic valuation of a(2n) is 3*A001045(n) (three times the values at the prime indices of Jacobsthal numbers), which is 2^n+1. For example: the 11-adic valuation at a(22) = 2049 = 3*A001045(11)= 683.  3*683 = 2^11+1 = 2049.  True because: When n is prime, n-adic valuation is 1 at A052129(n), then doubles as n-increases to 2n, at which point 1 is added; thus A052129(2n) = 2^n+1. Since 3*A001045(n) = 2^n+1, n-adic valuation of A052129(2n) = 3*A001045(n) when n is prime. - Bob Selcoe, Mar 06 2014
Unreduced denominators of: f(1) = 1, f(n) = f(n-1) + f(n-1)/(n-1). - Daniel Suteu, Jul 29 2016

			a(3) = 3*a(2)^2 = 3*(2*a(1)^2)^2 = 3*(2*(1*a(0)^2)^2)^2 = 3*(2*(1*1^2)^2)^2 = 3*(2*1)^2 = 3*4 = 12.
G.f. = 1 + x + 2*x^2 + 12*x^3 + 576*x^4 + 1658880*x^5 + 16511297126400*x^6 + ...

S. R. Finch, Mathematical Constants, Cambridge University Press, Cambridge, 2003, p. 446.

Vincenzo Librandi, Table of n, a(n) for n = 0..12
Sung-Hyuk Cha, On the k-ary Tree Combinatorics.
Chao-Ping Chen, Sharp inequalities and asymptotic series related to Somos' quadratic recurrence constant, Journal of Number Theory, 172 (2017), 145-159.
Chao-Ping Chen and X. F. Han, On Somos' quadratic recurrence constant, Journal of Number Theory, Volume 166, September 2016, Pages 31-40.
Olivier Golinelli, Remote control system of a binary tree of switches - II. balancing for a perfect binary tree, arXiv:2405.16968 [cs.DM], 2024. See p. 16.
Jesús Guillera and Jonathan Sondow, Double integrals and infinite products for some classical constants via analytic continuations of Lerch's transcendent, arXiv:math/0506319 [math.NT], 2005-2006.
Jesús Guillera and Jonathan Sondow, Double integrals and infinite products for some classical constants via analytic continuations of Lerch's transcendent, Ramanujan J. 16 (2008), 247-270.
Dawei Lu and Zexi Song, Some new continued fraction estimates of the Somos' quadratic recurrence constant, Journal of Number Theory, 155 (2015), 36-45.
Dawei Lu, Xiaoguang Wang, and Ruiqing Xu, Some New Exponential-Function Estimates of the Somos' Quadratic Recurrence Constant, Results in Mathematics 74(1) (2019), Article 6.
Gergo Nemes, On the coefficients of an asymptotic expansion related to Somos' quadratic recurrence constant, Applicable Analysis and Discrete Mathematics, 5(1) (2011), 60-66.
Jörg Neunhäuserer, On the universality of Somos' constant, arXiv:2006.02882 [math.DS], 2020.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, arXiv:math/0610499 [math.CA], 2006.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, J. Math. Anal. Appl. 332 (2007), 292-314.
Xu You and Di-Rong Chen, Improved continued fraction sequence convergent to the Somos' quadratic recurrence constant, Mathematical Analysis and Applications, 436(1) (2016), 513-520.
Eric Weisstein's World of Mathematics, Somos's Quadratic Recurrence Constant.

Cf. A000142, A001045, A030450, A088679, A112302, A116603, A123851, A123852, A123853, A123854, A238462 (2-adic valuation).

Join[{1},RecurrenceTable[{a[1]==1,a[n]==n a[n-1]^2},a,{n,10}]]  (* Harvey P. Dale, Apr 26 2011 *)
a[ n_] := If[ n < 1, Boole[n == 0], Product[ (n - k)^2^k, {k, 0, n - 1}]]; (* Michael Somos, May 24 2013 *)
a[n_] := Product[ k^(2^(n - k)), {k,1,n}] (* Jonathan Sondow, Mar 17 2014 *)
NestList[{#[[1]]+1,#[[1]]*#[[2]]^2}&,{1,1},10][[All,2]] (* Harvey P. Dale, Jul 30 2018 *)

{a(n) = if( n<1, n==0, prod(k=0, n-1, (n - k)^2^k))}; /* Michael Somos, May 24 2013 */

a(n) ~ s^(2^n) / (n + 2 - 1/n + 4/n^2 - 21/n^3 + 138/n^4 - 1091/n^5 + ...) where s = 1.661687949633... (see A112302) and A116603. - Michael Somos, Apr 02 2006
a(n) = n * A030450(n - 1) if n>0. - Michael Somos, Oct 22 2006
a(n) = (a(n-1) + a(n-2)^2) * (a(n-1) / a(n-2))^2. - Michael Somos, Mar 20 2012
a(n) = product_{k=1..n} k^(2^(n-k)). - Jonathan Sondow, Mar 17 2014
A088679(n+1)/a(n) = n+1. -Daniel Suteu, Jul 29 2016

A123854 Denominators in an asymptotic expansion for the cubic recurrence sequence A123851.

Original entry on oeis.org

1, 4, 32, 128, 2048, 8192, 65536, 262144, 8388608, 33554432, 268435456, 1073741824, 17179869184, 68719476736, 549755813888, 2199023255552, 140737488355328, 562949953421312, 4503599627370496, 18014398509481984, 288230376151711744, 1152921504606846976

Offset: 0

Petros Hadjicostas and Jonathan Sondow, Oct 15 2006

A cubic analog of the asymptotic expansion A116603 of Somos's quadratic recurrence sequence A052129. Numerators are A123853.
Equals 2^A004134(n); also the denominators in expansion of (1-x)^(-1/4). - Alexander Adamchuk, Oct 27 2006
All terms are powers of 2 and log_2 a(n) = A004134(n) = 3*n - A000120(n). - Alexander Adamchuk, Oct 27 2006 [Edited by Petros Hadjicostas, May 14 2020]
Is this the same sequence as A088802? - N. J. A. Sloane, Mar 21 2007
Almost certainly this is the same as A088802. - Michael Somos, Aug 23 2007
Denominators of Gegenbauer_C(2n,1/4,2). The denominators of Gegenbauer_C(n,1/4,2) give the doubled sequence. - Paul Barry, Apr 21 2009
If the Greubel formula in A088802 and the Luschny formula here are correct (they are the same), the sequence is a duplicate of A088802. - R. J. Mathar, Aug 02 2023

			A123851(n) ~ c^(3^n)*n^(- 1/2)/(1 + 3/(4*n) - 15/(32*n^2) + 113/(128*n^3) - 5397/(2048*n^4) + ...) where c = 1.1563626843322... is the cubic recurrence constant A123852.

Steven R. Finch, Mathematical Constants, Cambridge University Press, Cambridge, 2003, p. 446.

G. C. Greubel, Table of n, a(n) for n = 0..1000
T. M. Apostol, On the Lerch zeta function, Pacific J. Math. 1 (1951), 161-167. [In Eq. (3.7), p. 166, the index in the summation for the Apostol-Bernoulli numbers should start at s = 0, not at s = 1. - _Petros Hadjicostas_, Aug 09 2019]
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, arXiv:math/0610499 [math.CA], 2006.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, J. Math. Anal. Appl. 332 (2007), 292-314.
Eric Weisstein's World of Mathematics, Somos's Quadratic Recurrence Constant.
Aimin Xu, Asymptotic expansion related to the Generalized Somos Recurrence constant, International Journal of Number Theory 15(10) (2019), 2043-2055. [The author gives recurrences and other formulas for the coefficients of the asymptotic expansion using the Apostol-Bernoulli numbers (see the reference above) and the Bell polynomials. - _Petros Hadjicostas_, Aug 09 2019]

Cf. A052129, A112302, A116603, A123851, A123852, A123853 (numerators).

Cf. A004134, A004130, A000120.

f:=proc(t,x) exp(sum(ln(1+m*x)/t^m,m=1..infinity)); end; for j from 0 to 29 do denom(coeff(series(f(3,x),x=0,30),x,j)); od;
# Alternatively:
A123854 := n -> denom(binomial(1/4,n)):
seq(A123854(n), n=0..25); # Peter Luschny, Apr 07 2016

Denominator[CoefficientList[Series[ 1/Sqrt[Sqrt[1-x]], {x, 0, 25}], x]] (* Robert G. Wilson v, Mar 23 2014 *)

vector(25, n, n--; denominator(binomial(1/4,n)) ) \\ G. C. Greubel, Aug 08 2019

# uses[A000120]
def A123854(n): return 1 << (3*n-A000120(n))
[A123854(n) for n in (0..25)]  # Peter Luschny, Dec 02 2012

From Alexander Adamchuk, Oct 27 2006: (Start)
a(n) = 2^A004134(n).
a(n) = 2^(3n - A000120(n)). (End)
a(n) = denominator(binomial(1/4,n)). - Peter Luschny, Apr 07 2016

A003504 a(0)=a(1)=1; thereafter a(n+1) = (1/n)*Sum_{k=0..n} a(k)^2 (a(n) is not always integral!).

Original entry on oeis.org

1, 1, 2, 3, 5, 10, 28, 154, 3520, 1551880, 267593772160, 7160642690122633501504, 4661345794146064133843098964919305264116096, 1810678717716933442325741630275004084414865420898591223522682022447438928019172629856

Offset: 0

N. J. A. Sloane, R. K. Guy

The sequence appears with a different offset in some other sources. - Michael Somos, Apr 02 2006
Also known as Göbel's (or Goebel's) Sequence. Asymptotically, a(n) ~ n*C^(2^n) where C=1.0478... (A115632). A more precise asymptotic formula is given in A116603. - M. F. Hasler, Dec 12 2007
Let s(n) = (n-1)*a(n). By considering the p-adic representation of s(n) for primes p=2,3,...,43, one finds that a(44) is the first nonintegral value in this sequence. Furthermore, for n>44, the valuation of s(n) w.r.t. 43 is -2^(n-44), implying that both s(n) and a(n) are nonintegral. - M. F. Hasler and Max Alekseyev, Mar 03 2009
a(44) is approximately 5.4093*10^178485291567. - Hans Havermann, Nov 14 2017.
The fractional part is simply 24/43 (see page 709 of Guy (1988)).
The more precise asymptotic formula is a(n+1) ~ C^(2^n) * (n + 2 - 1/n + 4/n^2 - 21/n^3 + 138/n^4 - 1091/n^5 + ...). - Michael Somos, Mar 17 2012

			a(3) = (1 * 2 + 2^2) / 2 = 3 given a(2) = 2.

R. K. Guy, Unsolved Problems in Number Theory, 3rd edition, Sect. E15.
Clifford Pickover, A Passion for Mathematics, 2005.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..16
Hibiki Gima, Toshiki Matsusaka, Taichi Miyazaki, and Shunta Yara, On integrality and asymptotic behavior of the (k,l)-Göbel sequences, arXiv:2402.09064 [math.NT], 2024. See p. 1.
R. K. Guy, Letter to N. J. A. Sloane, Sep 25 1986.
R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712.
R. K. Guy, The strong law of small numbers. Amer. Math. Monthly 95 (1988), no. 8, 697-712. [Annotated scanned copy]
H. Ibstedt, Some sequences of large integers, Fibonacci Quart. 28 (1990), 200-203.
Yuh Kobayashi and Shin-ichiro Seki, On the length over which k-Göbel sequences remain integers, arXiv:2502.17448 [math.CO], 2025.
H. W. Lenstra, Jr., R. K. Guy, and N. J. A. Sloane, Correspondence, 1975-1978
N. Lygeros and M. Mizony, Study of primality of terms of a_k(n)=(1+(sum from 1 to n-1)(a_k(i)^k))/(n-1)
Rinnosuke Matsuhira, Toshiki Matsusaka, and Koki Tsuchida, How long can k-Göbel sequences remain integers?, arXiv:2307.09741 [math.NT], 2023.
D. Rusin, Law of small numbers [Broken link]
D. Rusin, Law of small numbers [Cached copy]
Alex Stone, The Astonishing Behavior of Recursive Sequences, Quanta Magazine, Nov 16 2023, 13 pages.
Eric Weisstein's World of Mathematics, Göbel's Sequence
D. Zagier, Problems posed at the St Andrews Colloquium, 1996
D. Zagier, Solution: Day 5, problem 3

Cf. A005166, A005167, A097398, A108394, A115632, A116603 (asymptotic formula).

a:=2: L:=1,1,a: n:=15: for k to n-2 do a:=a*(a+k)/(k+1): L:=L,a od:L; # Robert FERREOL, Nov 07 2015

a[n_] := a[n] = Sum[a[k]^2, {k, 0, n-1}]/(n-1); a[0] = a[1] = 1; Table[a[n], {n, 0, 13}] (* Jean-François Alcover, Feb 06 2013 *)
With[{n = 14}, Nest[Append[#, (#.#)/(Length[#] - 1)] &, {1, 1}, n - 2]] (* Jan Mangaldan, Mar 21 2013 *)

A003504(n,s=2)=if(n-->0,for(k=1,n-1,s+=(s/k)^2);s/n,1) \\ M. F. Hasler, Dec 12 2007

a=2; L=[1,1,a]; n=15
for k in range(1,n-1):
    a=a*(a+k)//(k+1)
    L.append(a)
print(L) # Robert FERREOL, Nov 07 2015

a(n+1) = ((n-1) * a(n) + a(n)^2) / n if n > 1. - Michael Somos, Apr 02 2006

0 = a(n)*(+a(n)*(a(n+1) - a(n+2)) - a(n+1) - a(n+1)^2) +a(n+1)*(a(n+1)^2 - a(n+2)) if n>1. - Michael Somos, Jul 25 2016

a(0)..a(43) are integral, but from a(44) onwards every term is nonintegral - H. W. Lenstra, Jr.
Corrected and extended by M. F. Hasler, Dec 12 2007
Further corrections from Max Alekseyev, Mar 04 2009

A123851 A cubic recurrence: a(0) = 1, a(n) = n*a(n-1)^3 for n >= 1.

Original entry on oeis.org

1, 1, 2, 24, 55296, 845378412871680, 3624972460853492659595005581182702601633792000

Offset: 0

Petros Hadjicostas and Jonathan Sondow, Oct 15 2006

A cubic analog of Somos's quadratic recurrence sequence A052129.

Terms a(7) onward are too big to include in data section. - G. C. Greubel, Aug 10 2019

			a(3) = 3*a(2)^3 = 3*(2*a(1)^3)^3 = 3*(2*(1*a(0)^3)^3)^3 = 3*(2*(1*1^3)^3)^3 = 3*(2*1)^3 = 3*8 = 24.
G.f. = 1 + x + 2*x^2 + 24*x^3 + 55296*x^4 + 845378412871680*x^5 + ...

Steven R. Finch, Mathematical Constants, Cambridge University Press, Cambridge, 2003, p. 446.

G. C. Greubel, Table of n, a(n) for n = 0..8
Sung-Hyuk Cha, On the k-ary Tree Combinatorics.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, arXiv:0610499 [math.CA], 2006.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, J. Math. Anal. Appl. 332 (2007), 292-314.
Eric Weisstein's World of Mathematics, Somos's Quadratic Recurrence Constant.
Aimin Xu, Asymptotic expansion related to the Generalized Somos Recurrence constant, International Journal of Number Theory 15(10) (2019), 2043-2055.

Cf. A052129, A112302, A116603, A123852, A123853, A123854.

List([0..8], n-> Product([0..n-1], k-> (n-k)^(3^k)) ); # G. C. Greubel, Aug 10 2019

[n eq 0 select 1 else (&*[(n-k)^(3^k): k in [0..n-1]]):n in [0..8]]; // G. C. Greubel, Aug 10 2019

a[n_]:= If[n==0, 1, n*a[n-1]^3]; Table[a[n], {n,0,7}]
nxt[{n_,a_}]:={n+1, (n+1)a^3}; NestList[nxt,{0,1},7][[All,2]] (* Harvey P. Dale, May 25 2019 *)

{a(n) = if( n<1, n==0, prod(k=0, n-1, (n - k)^3^k))}; /* Michael Somos, Aug 07 2016 */

[1]+[prod((n-k)^(3^k) for k in (0..n-1)) for n in (1..8)] # G. C. Greubel, Aug 10 2019

a(n) ~ c^(3^n)*n^(-1/2)/(1 + 3/(4*n) - 15/(32*n^2) + 113/(128*n^3) + ...) where c = 1.1563626843322... is the cubic recurrence constant A123852.

Corrected by Harvey P. Dale, May 25 2019

A123852 Decimal expansion of (1(2(3*...)^(1/3))^(1/3))^(1/3).

Original entry on oeis.org

1, 1, 5, 6, 3, 6, 2, 6, 8, 4, 3, 3, 2, 2, 6, 9, 7, 1, 6, 8, 5, 3, 3, 7, 0, 3, 2, 2, 8, 8, 7, 3, 6, 9, 3, 5, 6, 5, 1, 3, 0, 1, 4, 5, 4, 3, 8, 9, 1, 8, 8, 8, 6, 3, 7, 9, 9, 9, 2, 5, 9, 5, 9, 8, 9, 8, 3, 1, 7, 7, 8, 1, 6, 0, 7, 2, 8, 2, 6, 1, 9, 4, 6, 0, 7, 9, 0, 8, 1, 3, 3, 8, 2, 0, 3, 7, 8, 3, 1, 7

Offset: 1

Petros Hadjicostas and Jonathan Sondow, Oct 15 2006

Cubic recurrence constant (see A123851): a cubic analog of Somos's quadratic recurrence constant A112302.

			1.156362684332269716853370322887369356513014543891888637999259598983177816...

Steven R. Finch, Mathematical Constants, Cambridge University Press, Cambridge, 2003, p. 446.

Kh. Hessami Pilehrood and T. Hessami Pilehrood, Vacca-type series for values of the generalized-Euler-constant function and its derivative, arXiv:0808.0410 [math.NT], 2008.
Kh. Hessami Pilehrood and T. Hessami Pilehrood, Vacca-type series for values of the generalized-Euler-constant function and its derivative, Journal of Integer Sequences 13 (2010), Article 10.7.3.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, arXiv:math/0610499 [math.CA], 2006.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, J. Math. Anal. Appl. 332(1) (2007), 292-314.
Eric Weisstein's World of Mathematics, Somos's Quadratic Recurrence Constant.

Cf. A052129, A112302, A116603, A123851, A123853, A123854.

Take[RealDigits[Product[N[n^3^-n,200], {n,400}]][[1]], 100]
RealDigits[Exp[-D[PolyLog[n, 1/3], n]/.n->0], 10, 100][[1]] (* Jean-François Alcover, Jan 28 2014 *)

prodinf(n=1, n^(1/3^n)) \\ Michel Marcus, Aug 03 2019

Equals Product_{n>=1} n^(1/3^n).

References updated by R. J. Mathar, Aug 12 2010

A123853 Numerators in an asymptotic expansion for the cubic recurrence sequence A123851.

Original entry on oeis.org

1, 3, -15, 113, -5397, 84813, -3267755, 74391561, -15633072909, 465681118929, -31041303829713, 1145088996404679, -185348722911971841, 8165727090278785521, -778296382754673737187, 39898888480559205453945, -35033447016186321707305533

Offset: 0

Petros Hadjicostas and Jonathan Sondow, Oct 15 2006

A cubic analog of the asymptotic expansion A116603 of Somos's quadratic recurrence sequence A052129. Denominators are A123854.

			A123851(n) ~ c^(3^n)*n^(-1/2)/(1 + 3/(4*n) - 15/(32*n^2) + 113/(128*n^3) - 5397/(2048*n^4) + ...) where c = 1.1563626843322... is the cubic recurrence constant A123852.

Steven R. Finch, Mathematical Constants, Cambridge University Press, Cambridge, 2003, p. 446.

T. M. Apostol, On the Lerch zeta function, Pacific J. Math. 1 (1951), 161-167. [In Eq. (3.7), p. 166, the index in the summation for the Apostol-Bernoulli numbers should start at s = 0, not at s = 1. - _Petros Hadjicostas_, Aug 09 2019]
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, arXiv:math/0610499 [math.CA], 2006.
Jonathan Sondow and Petros Hadjicostas, The generalized-Euler-constant function gamma(z) and a generalization of Somos's quadratic recurrence constant, J. Math. Anal. Appl. 332 (2007), 292-314.
Eric Weisstein's World of Mathematics, Somos's Quadratic Recurrence Constant.
Aimin Xu, Asymptotic expansion related to the Generalized Somos Recurrence constant, International Journal of Number Theory 15(10) (2019), 2043-2055. [The author gives recurrences and other formulas for the coefficients of the asymptotic expansion using the Apostol-Bernoulli numbers (see the reference above) and the Bell polynomials. - _Petros Hadjicostas_, Aug 09 2019]

Cf. A052129, A112302, A116603, A123851, A123852, A123854 (denominators).

f:=proc(t,x) exp(sum(ln(1+m*x)/t^m,m=1..infinity)); end; for j from 0 to 29 do numer(coeff(series(f(3,x),x=0,30),x,j)); od;

{a(n) = local(A); if(n < 0, 0, A = 1 + O(x) ; for( k = 1, n, A = truncate(A) + x * O(x^k); A += x^k * polcoeff( 3/4 * (subst(1/A, x, x^2/(1-x^2))^2/(1-x^2) - 1/subst(A, x, x^2)^(2/3)), 2*k ) ); numerator( polcoeff( A, n ) ) ) } /* Michael Somos, Aug 23 2007 */

A384332 Expansion of Product_{k>=1} (1 + k*x)^((2/3)^k).

Original entry on oeis.org

1, 6, 3, 20, -207, 2538, -36381, 599760, -11210229, 234779146, -5455240455, 139445920452, -3892724842549, 117916363928070, -3854035833235839, 135241405277665656, -5072575747811807052, 202559732310632082120, -8581116791103001216108

Offset: 0

Seiichi Manyama, May 26 2025

sign

Cf. A116603, A384333, A384334.

Cf. A004123, A384324, A384344.

terms = 20; A[] = 1; Do[A[x] = -2*A[x] + 3*A[x/(1+x)]^(2/3) * (1+x)^2 + O[x]^j // Normal, {j, 1, terms}]; CoefficientList[A[x], x] (* Vaclav Kotesovec, May 27 2025 *)

my(N=20, x='x+O('x^N)); Vec(exp(3*sum(k=1, N, (-1)^(k-1)*sum(j=0, k, 2^j*j!*stirling(k, j, 2))*x^k/k)))

G.f. A(x) satisfies A(x) = (1+x)^2 * A(x/(1+x))^(2/3).
G.f.: exp(3 * Sum_{k>=1} (-1)^(k-1) * A004123(k+1) * x^k/k).
G.f.: 1/B(-x), where B(x) is the g.f. of A384324.
G.f.: B(x)^6, where B(x) is the g.f. of A384344.
a(n) ~ (-1)^(n+1) * (n-1)! / log(3/2)^(n+1). - Vaclav Kotesovec, May 27 2025

A384333 Expansion of Product_{k>=1} (1 + k*x)^((3/4)^k).

Original entry on oeis.org

1, 12, 30, 76, -819, 15120, -320568, 7719984, -208986462, 6300545128, -209806494828, 7660698340008, -304718887446110, 13127557400200944, -609336227455254936, 30330991088734345200, -1612305658103085757467, 91179423240593288760396, -5467060640706775435713298

Offset: 0

Seiichi Manyama, May 26 2025

sign

Cf. A116603, A384332, A384334.

Cf. A032033, A381890, A384325.

terms = 20; A[] = 1; Do[A[x] = -3*A[x] + 4*A[x/(1+x)]^(3/4) * (1+x)^3 + O[x]^j // Normal, {j, 1, terms}]; CoefficientList[A[x], x] (* Vaclav Kotesovec, May 27 2025 *)

my(N=20, x='x+O('x^N)); Vec(exp(4*sum(k=1, N, (-1)^(k-1)*sum(j=0, k, 3^j*j!*stirling(k, j, 2))*x^k/k)))

G.f. A(x) satisfies A(x) = (1+x)^3 * A(x/(1+x))^(3/4).
G.f.: exp(4 * Sum_{k>=1} (-1)^(k-1) * A032033(k) * x^k/k).
G.f.: 1/B(-x), where B(x) is the g.f. of A384325.
G.f.: B(x)^12, where B(x) is the g.f. of A381890.
a(n) ~ (-1)^(n+1) * (n-1)! / log(4/3)^(n+1). - Vaclav Kotesovec, May 27 2025

A384334 Expansion of Product_{k>=1} (1 + k*x)^((4/5)^k).

Original entry on oeis.org

1, 20, 110, 340, -1995, 53904, -1534600, 49159600, -1758057650, 69662897000, -3037327435860, 144787947993000, -7502235351828450, 420296374337607600, -25335189019626256200, 1636008982452733508400, -112721505676611504401025, 8256863266451569604835900

Offset: 0

Seiichi Manyama, May 26 2025

sign

Cf. A116603, A384332, A384333.

Cf. A094417, A384326, A384345.

terms = 20; A[] = 1; Do[A[x] = -4*A[x] + 5*A[x/(1+x)]^(4/5) * (1+x)^4 + O[x]^j // Normal, {j, 1, terms}]; CoefficientList[A[x], x] (* Vaclav Kotesovec, May 27 2025 *)

my(N=20, x='x+O('x^N)); Vec(exp(5*sum(k=1, N, (-1)^(k-1)*sum(j=0, k, 4^j*j!*stirling(k, j, 2))*x^k/k)))

G.f. A(x) satisfies A(x) = (1+x)^4 * A(x/(1+x))^(4/5).
G.f.: exp(5 * Sum_{k>=1} (-1)^(k-1) * A094417(k) * x^k/k).
G.f.: 1/B(-x), where B(x) is the g.f. of A384326.
G.f.: B(x)^20, where B(x) is the g.f. of A384345.
a(n) ~ (-1)^(n+1) * (n-1)! / log(5/4)^(n+1). - Vaclav Kotesovec, May 27 2025

cp's OEIS Frontend

A112302 Decimal expansion of quadratic recurrence constant sqrt(1 * sqrt(2 * sqrt(3 * sqrt(4 * ...)))).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Python

Formula

A052129 a(0) = 1; thereafter a(n) = n*a(n-1)^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A123854 Denominators in an asymptotic expansion for the cubic recurrence sequence A123851.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Formula

A003504 a(0)=a(1)=1; thereafter a(n+1) = (1/n)*Sum_{k=0..n} a(k)^2 (a(n) is not always integral!).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

Extensions

A123851 A cubic recurrence: a(0) = 1, a(n) = n*a(n-1)^3 for n >= 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

Extensions

A123852 Decimal expansion of (1*(2*(3*...)^(1/3))^(1/3))^(1/3).

Views

Author

A123852 Decimal expansion of (1(2(3*...)^(1/3))^(1/3))^(1/3).