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.

A057108 Difference between the smallest number S(n) with S(n)! a multiple of n and the largest prime factor of n [taking a(1)=0].

Original entry on oeis.org

0, 0, 0, 2, 0, 0, 0, 2, 3, 0, 0, 1, 0, 0, 0, 4, 0, 3, 0, 0, 0, 0, 0, 1, 5, 0, 6, 0, 0, 0, 0, 6, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 3, 7, 5, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 5, 0, 0, 0, 0, 1, 6, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 5, 0, 7, 0, 5, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Henry Bottomley, Aug 08 2000

Keywords

Examples

			a(12)=1 since 12 is a factor of 4!, 3 is the largest prime factor of 12 and 4-3=1
		

References

  • Steven R. Finch, Mathematical Constants, Cambridge, 2003, pp. 284-292.

Crossrefs

Programs

Formula

a(n) = A002034(n) - A006530(n).

Extensions

More terms from James Sellers, Aug 22 2000