login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257675 a(n) = A257673(2n,n). 3

%I #19 Aug 23 2021 05:54:43

%S 1,3,21,174,1509,13473,122580,1129999,10518477,98644395,930607321,

%T 8821717743,83960385396,801783097911,7678690148647,73721697254874,

%U 709323064431597,6837868454315828,66028546945097793,638555320797561440,6183787002091288969,59957399899953193063

%N a(n) = A257673(2n,n).

%H Alois P. Heinz, <a href="/A257675/b257675.txt">Table of n, a(n) for n = 0..500</a>

%F a(n) = A257673(2n,n).

%F a(n) ~ c * d^n / sqrt(n), where d = 9.93288639318036180192949205242384178223421389697248991016311001938239..., c = 0.31807008223273549425589833682845775837952038959... . - _Vaclav Kotesovec_, May 19 2015

%F a(n) = [x^(2*n)] (-1 + Product_{k>=1} 1 / (1 - x^k)^k)^n. - _Ilya Gutkovskiy_, Feb 13 2021

%p g:= proc(n) option remember; `if`(n=0, 1, add(

%p g(n-j)*numtheory[sigma][2](j), j=1..n)/n)

%p end:

%p b:= proc(n, k) option remember; `if`(k<2, g(n+1), (q->

%p add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2)))

%p end:

%p a:= n-> b(n$2):

%p seq(a(n), n=0..22);

%t g[n_] := g[n] = If[n == 0, 1, Sum[g[n - j]*

%t DivisorSigma[2, j], {j, 1, n}]/n];

%t b[n_, k_] := b[n, k] = If[k < 2, g[n+1], With[{q = Quotient[k, 2]},

%t Sum[b[j, q] b[n - j, k - q], {j, 0, n}]]];

%t a[n_] := b[n, n];

%t Table[a[n], {n, 0, 22}] (* _Jean-François Alcover_, Aug 23 2021, after _Alois P. Heinz_ *)

%Y Cf. A000219, A257673.

%K nonn

%O 0,2

%A _Alois P. Heinz_, May 03 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 10:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)