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.

Showing 1-2 of 2 results.

A325630 Numbers k such that A000110(k) is divisible by k.

Original entry on oeis.org

1, 2, 35, 16833, 16989, 23684
Offset: 1

Views

Author

Vaclav Kotesovec, Sep 07 2019

Keywords

Comments

No other terms below 50000.
From Amiram Eldar, Jun 20 2024: (Start)
Numbers k such that A166226(k) = 0.
All the terms above 2 are composites since A166226(p) == 2 (mod p) for prime p. (End)
No other terms below 90000. - Michael S. Branicky, Jan 09 2025

Examples

			35 is in the sequence because A000110(35) = 35 * 8045720086273150473238297902.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[1000], Divisible[BellB[#], #] &]

A327433 Smallest k > 2, such that A000587(k) is divisible by n.

Original entry on oeis.org

3, 5, 6, 11, 8, 20, 10, 14, 6, 8, 14, 35, 16, 47, 41, 14, 12, 20, 22, 11, 15, 14, 26, 74, 8, 44, 74, 47, 23, 41, 19, 14, 32, 20, 47, 35, 18, 71, 19, 206, 19, 71, 25, 14, 41, 26, 50, 74, 150, 8, 20, 215, 56, 74, 39, 86, 22, 23, 10, 230, 16, 191, 15, 38, 44, 32
Offset: 1

Views

Author

Vaclav Kotesovec, Sep 10 2019

Keywords

Comments

Conjecture: Such number exists for all n.

Crossrefs

Showing 1-2 of 2 results.