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.

A246909 a(n) = the smallest numbers k such that sigma(k+sigma(k)) = n* sigma(k) or -1 if no solution exists or has been found for n.

Original entry on oeis.org

-1, 2, 1, 28, 15456, 831376
Offset: 1

Views

Author

Jaroslav Krizek, Sep 07 2014

Keywords

Comments

a(7) > 10^7 or -1.

Examples

			Sequence of numbers k such that sigma(k+sigma(k)) = n* sigma(k)  for 1 <= n <= 6:
n = 2: 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, 173, … (A246857).
n = 3: 1, 7, 26, 30, 42, 54, 69, 78, 84, 94, 102, 103, 114, … (A246910).
n = 4: 28, 66, 348, 496, 840, 920, 1320, 1416, 1602, 1770, … (A246911).
n = 5: 15456, 16920, 48576, 59520, 107160, 153360, 232596, … (A246912).
n = 6: 831376, 3944688, 16956576, 17843616, … (A246913).
		

Crossrefs

Programs