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.

A076537 Map positive rational numbers to positive integers by diagonal method using c(p,q) = (p + q - 2) * (p + q - 1) / 2 + p where p and q are positive integers. a(n) is an increasing sequence including all c(p,q) where gcd(p,q) > 1.

Original entry on oeis.org

5, 12, 13, 14, 23, 25, 27, 31, 34, 38, 40, 41, 42, 44, 57, 58, 59, 61, 63, 64, 65, 80, 82, 84, 85, 86, 88, 90, 94, 96, 97, 100, 101, 103, 107, 109, 111, 113, 115, 117, 119, 138, 139, 140, 142, 144, 145, 146, 148, 150, 151, 152, 173, 175, 176, 177, 179, 181, 183
Offset: 1

Views

Author

Robert A. Stump (bee_ess107(AT)msn.com), Oct 18 2002

Keywords

Examples

			a(1) = c(2,2) = (2 + 2 - 2) * (2 + 2 - 1) / 2 + 2 = 5 because gcd(2,2) = 2 > 1.
a(2) = c(2,4) = (2 + 4 - 2) * (2 + 4 - 1) / 2 + 2 = 12 because gcd(2,4) = 2 > 1.
		

Programs

  • PARI
    a(n)=if(n<1,0,n=a(n-1); until(1