login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083396 Least n such that n and 2k+n are both brilliant numbers. 0

%I

%S 4,6,4,6,4,9,21,9,169,15,121,25,9,21,289,221,15,253,209,9,247,143,253,

%T 121,341,169,323,437,319,187,299,649,121,221,253,49,377,247,143,209,

%U 391,169,35,121,209,299,49,25,221,21,187,143,15,35,143,9,209,377,25,49,21

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

%C 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.)

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

%Y Cf. A078972, A083284, A083285.

%K base,nonn

%O 1,1

%A _Jason Earls_, Jun 06 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 19 12:35 EDT 2019. Contains 325159 sequences. (Running on oeis4.)