The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A365850 Numbers k for which k^2 + (k')^2 is a square, where k' is the arithmetic derivative of k (A003415). 0
0, 1, 12, 15, 35, 81, 143, 323, 400, 441, 899, 1540, 1763, 2700, 3599, 4641, 5183, 5929, 9375, 10395, 10403, 11663, 13585, 18225, 19043, 21952, 22499, 30576, 32399, 35581, 36863, 39203, 48841, 51983, 57599, 72899, 79523, 97343, 121103, 148176, 166375, 175692, 176399 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
If p and p + 2 are twin primes (A001359) then m = p*(p + 2) is a term. Indeed, m' = p + (p + 2) = 2*p + 2 and m^2 + (m')^2 = p^2*(p + 2)^2 + (2*p + 2)^2 = (p^2 + 2*p + 2)^2.
More generally, if p and p + 2*k, k >= 1, are prime numbers, then m = p^k*(p + 2*k)^k is a term. Indeed, m' = k*p^(k - 1)*(p + 2*k)^k+ k*p^k*(p + 2*k)^(k - 1) = k*p^(k - 1)*(p + 2*k)^(k-1)*(2*p + 2*k). Thus, m^2 + (m')^2 = p^(2*k)*(p + 2*k)^(2*k) + (k^2)*p^(2*k - 2)*(p + 2*k)^(2*k - 2)*(2*p + 2*k)^2 = p^(2*k - 2)*(p + 2*k)^(2*k - 2)*(p^2*(p + 2*k)^2 + k^2*(2*p + 2*k)^2) = p^(2*k - 2)*(p + 2*k)^(2*k - 2)*(2*k^2 + 2*k*p + p^2)^2.
LINKS
EXAMPLE
For k = 12, k' = 16 and 12^2 + 16^2 = 144 + 256 = 400 = 20^2, so 12 is a term.
For k = 15, k' = 8 and 15^2 + 8^2 = 225 + 64 = 289 = 17^2, so 15 is a term.
For k = 143, k' = 24 and 143^2 + 24^2 = 144 + 256 = 21025 = 145^2, so 143 is a term.
MAPLE
ader:= proc(n) local f; n*add(f[2]/f[1], f=ifactors(n)[2]) end proc:
select(t -> issqr(t^2 + ader(t)^2), [$0..10^6]; # Robert Israel, Oct 17 2023
MATHEMATICA
d[0] = d[1] = 0; d[n_] := n*Plus @@ ((Last[#]/First[#]) & /@ FactorInteger[n]); Select[Range[0, 180000], IntegerQ[Sqrt[#^2 + d[#]^2]] &] (* Amiram Eldar, Oct 11 2023 *)
PROG
(Magma) f:=func<n |n le 1 select 0 else n*(&+[Factorisation(n)[i][2] / Factorisation(n)[i][1]: i in [1..#Factorisation(n)]])>; [n:n in [0..200000] |IsSquare( n^2+( Floor(f(n))^2))];
CROSSREFS
Sequence in context: A296796 A161917 A065150 * A277082 A087098 A109315
KEYWORD
nonn
AUTHOR
Marius A. Burtea, Oct 09 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 17:07 EDT 2024. Contains 372603 sequences. (Running on oeis4.)