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!)
A159667 For n >= 1, a(n) = A159666(n)/n. 2
1, 2, 6, 26, 133, 905, 6521, 57126, 544820, 5878219, 66851119, 881424550, 11803494823, 175906313032, 2767829058956, 47008174824136, 821285150996811, 15816596073011143, 308160754687446289, 6498330632792677804 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) is divisible by n, for all n >= 1.
LINKS
MATHEMATICA
f[n_] := f[n] = Sum[Binomial[n, k] GCD[n, k] f[k - 1], {k, n}]; f[0] = 1; Table[f@n/n, {n, 22}] (* Robert G. Wilson v, May 27 2009 *)
PROG
(SageMath)
@CachedFunction
def b(n): return 1 if (n==0) else sum(binomial(n, j)*gcd(n, j)*b(j-1) for j in range(1, n+1)) # b = A159666
def A159667(n): return b(n)/n
[A159667(n) for n in range(1, 40)] # G. C. Greubel, Sep 27 2022
CROSSREFS
Cf. A159666.
Sequence in context: A030850 A030951 A030876 * A370215 A326562 A030957
KEYWORD
nonn
AUTHOR
Leroy Quet, Apr 19 2009
EXTENSIONS
More terms from Robert G. Wilson v, May 27 2009
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 April 24 19:31 EDT 2024. Contains 371962 sequences. (Running on oeis4.)