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.

A167211 Numbers k such that number of perfect partitions of k-1 divides k.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 11, 13, 15, 16, 17, 19, 21, 23, 29, 31, 32, 33, 37, 39, 40, 41, 43, 47, 48, 51, 53, 57, 59, 61, 64, 67, 69, 71, 73, 78, 79, 83, 87, 89, 93, 97, 101, 103, 107, 109, 111, 113, 123, 127, 128, 129, 130, 131, 132, 137, 139, 141, 149, 151, 157
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Oct 30 2009

Keywords

Crossrefs

Programs

  • Mathematica
    f[1] = 1; f[n_] := f[n] = DivisorSum[n, f[#] &, # < n &]; Select[Range[100], Divisible[#, f[#]] &] (* Amiram Eldar, Dec 30 2019 *)

Formula

{n: A002033(n-1) | n}.

Extensions

Definition corrected by R. J. Mathar, May 21 2010
More terms from Amiram Eldar, Dec 30 2019