cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A326579 a(n) = n*denominator(n*Bernoulli(n-1)) for n >= 1 and a(0) = 0.

Original entry on oeis.org

0, 1, 2, 6, 4, 30, 6, 42, 8, 90, 10, 66, 12, 2730, 14, 30, 16, 510, 18, 798, 20, 2310, 22, 138, 24, 13650, 26, 54, 28, 870, 30, 14322, 32, 5610, 34, 210, 36, 1919190, 38, 78, 40, 13530, 42, 1806, 44, 2070, 46, 282, 48, 324870, 50, 1122, 52, 1590, 54, 43890, 56
Offset: 0

Views

Author

Peter Luschny, Jul 17 2019

Keywords

Comments

Conjecture: For n>1: denominator(Bernoulli(n-1)) = n*denominator(n*Bernoulli(n-1)) <=> n is Korselt <=> n is prime or n is Carmichael.

Crossrefs

Cf. A326578, A326478, A326577, A027641/A027642 (Bernoulli), A002997 (Carmichael), A324050 (Korselt).

Programs

  • Maple
    A326579 := n -> `if`(n = 0, 0, n*denom(n*bernoulli(n-1))): seq(A326579(n), n=0..56);
  • Mathematica
    a[n_] := n * Denominator[n * BernoulliB[n - 1]]; a[0] = 0; Array[a, 60, 0] (* Amiram Eldar, Apr 26 2024 *)
  • PARI
    a(n) = if (n, n*denominator(n*bernfrac(n-1)), 0); \\ Michel Marcus, Jul 19 2019

Formula

a(2*n) = 2*n.