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-1 of 1 results.

A158292 Numbers k where the sum of all of its divisors != sqrt(k) exceeds the sum of all the divisors of m != sqrt(m) for all m < k.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 10, 12, 18, 20, 24, 30, 36, 40, 42, 48, 60, 72, 84, 90, 96, 108, 120, 144, 156, 168, 180, 210, 216, 240, 288, 300, 336, 360, 420, 480, 504, 540, 600, 630, 660, 720, 840, 960, 1008, 1080, 1200, 1260, 1440, 1560, 1620, 1680, 1800, 1920, 1980
Offset: 1

Views

Author

J. Lowell, Mar 15 2009

Keywords

Examples

			9 is not a term because the value for 8 is 1 + 2 + 4 + 8 = 15 but the value for 9 is 1 + 9 = 10.
		

Crossrefs

Cf. A141406.

Programs

  • Maple
    sodNosqrt := proc(n) a := 0 ; for d in numtheory[divisors](n) do if d^2 <> n then a := a+d ; fi; od: a ; end: L := [seq(sodNosqrt(n),n=1..2500)] ; read("transforms") ; RECORDS(L)[2] ; # R. J. Mathar, Mar 30 2009

Extensions

More terms from R. J. Mathar, Mar 30 2009
Showing 1-1 of 1 results.