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.

A176887 Let A001358(n) = prime(m)*prime(k). Then a(n) = abs(prime(m)*k - prime(k)*m).

Original entry on oeis.org

0, 1, 0, 1, 1, 1, 2, 1, 0, 1, 7, 3, 1, 3, 8, 5, 0, 13, 8, 14, 9, 9, 9, 19, 13, 9, 15, 16, 15, 28, 10, 29, 17, 17, 21, 38, 24, 25, 19, 0, 25, 43, 44, 20, 29, 49, 31, 1, 37, 31, 38, 35, 58, 29, 37, 0, 67, 41, 68, 51, 8, 47, 77, 49, 46, 58, 49, 7, 82, 51, 59, 47, 51, 83, 11, 53, 66, 92, 10
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Apr 28 2010

Keywords

Comments

The sequence is defined by considering first m<=k, adding the difference prime(m)*k-prime(k)*m to the sequence if >=0, then considering for the same semiprime m>=k, and adding the difference also to the sequence if >=0 and if different from the previous swapped case. - R. J. Mathar, May 06 2010

Examples

			a(1)=0 because prime(1)*1-prime(1)*1=2-2=0; a(2)=1 because prime(1)*2-prime(2)*1=4-3=1.
		

Crossrefs

Cf. A001358.

Extensions

a(25), a(43), a(44) and maybe others corrected by R. J. Mathar, May 06 2010
New name from Pontus von Brömssen and Charles R Greathouse IV, Apr 18 2022