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.

A018255 Divisors of 30.

Original entry on oeis.org

1, 2, 3, 5, 6, 10, 15, 30
Offset: 1

Views

Author

Keywords

Comments

For n > 1, These are also numbers m such that k^4 + (k+1)^4 + ... + (k + m - 1)^4 is prime for some k and numbers m such that k^8 + (k+1)^8 + ... + (k + m - 1)^8 is prime for some k. - Derek Orr, Jun 12 2014
These seem to be the numbers m such that tau(n) = n*sigma(n) mod m for all n. See A098108 (mod 2), A126825 (mod 3), and A126832 (mod 5). - Charles R Greathouse IV, Mar 17 2022
The squarefree 5-smooth numbers: intersection of A051037 and A005117. - Amiram Eldar, Sep 26 2023

Examples

			From the second comment: 1^3 + 2^3 + 2^3 + 2^3 + 4^3 + 4^3 + 4^3 + 8^3 = (1 + 2 + 2 + 2 + 4 + 4 + 4 + 8)^2 = 729. - _Bruno Berselli_, Dec 28 2014
		

References

  • Boris A. Kordemsky, The Moscow Puzzles: 359 Mathematical Recreations, C. Scribner's Sons (1972), Chapter XIII, Paragraph 349.

Crossrefs

Programs

Formula

a(n) = A161715(n-1). - Reinhard Zumkeller, Jun 21 2009
Sum_{i=1..8} A000005(a(i))^3 = (Sum_{i=1..8} A000005(a(i)))^2, see Kordemsky in References and Barbeau et al. in Links section. - Bruno Berselli, Dec 28 2014