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!)
A122698 a(1)=a(2)=1 then a(n) = Sum_{d|n, 1<d<n} a(d)*a(n/d). 8
1, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 42, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
LINKS
FORMULA
a(1) = 1, for k>=0 a(2^(k+1)) = A000108(k) and if n>1 is not a power of 2 a(n) = 0.
MATHEMATICA
a[1] = a[2] = 1; a[n_] := a[n] = DivisorSum[n, a[#] * a[n/#] &, 1 < # < n &]; Array[a, 100]
(* or *)
a[n_] := Module[{e = IntegerExponent[n, 2]}, If[n == 2^e, CatalanNumber[e-1], 0]]; a[1] = 1; a[n_?OddQ] = 0; Array[a, 100] (* Amiram Eldar, Sep 05 2023 *)
PROG
(PARI) a(n)=if(n<3, 1, sumdiv(n, d, if((d-1)*(d-n), a(d)*a(n/d), 0)))
(PARI) a(n)={my(e=valuation(n, 2)); if(n==1<<e, if(e==0, 1, binomial(2*e-2, e-1)/e), 0)} \\ Andrew Howroyd, Aug 05 2018
CROSSREFS
Cf. A000108.
Sequence in context: A286100 A359431 A338210 * A002483 A282530 A060478
KEYWORD
nonn,easy,mult
AUTHOR
Benoit Cloitre, Sep 22 2006
EXTENSIONS
Keyword:mult added by Andrew Howroyd, Aug 05 2018
STATUS
approved

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 06:13 EDT 2024. Contains 371265 sequences. (Running on oeis4.)