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.

A083396 Least n such that n and 2k+n are both brilliant numbers.

Original entry on oeis.org

4, 6, 4, 6, 4, 9, 21, 9, 169, 15, 121, 25, 9, 21, 289, 221, 15, 253, 209, 9, 247, 143, 253, 121, 341, 169, 323, 437, 319, 187, 299, 649, 121, 221, 253, 49, 377, 247, 143, 209, 391, 169, 35, 121, 209, 299, 49, 25, 221, 21, 187, 143, 15, 35, 143, 9, 209, 377, 25, 49, 21
Offset: 1

Views

Author

Jason Earls, Jun 06 2003

Keywords

Comments

Conjecture: for any k >= 1 there will always be a brilliant constellation of the form {n, 2k+n} for some n. (True for all k <= 5000.)

Examples

			a(9)=169 because 169=13*13 and 169+18=11*17.

Crossrefs

Cf. A078972, A083284, A083285.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.