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!)
A009188 Short leg of more than one Pythagorean triangle. 5

%I #43 Feb 05 2023 10:38:37

%S 9,12,15,16,18,20,21,24,25,27,28,30,32,33,35,36,39,40,42,44,45,48,49,

%T 50,51,52,54,55,56,57,60,63,64,65,66,68,69,70,72,75,76,77,78,80,81,84,

%U 85,87,88,90,91,92,93,95,96,98,99,100,102,104,105,108,110,111,112,114,115,116

%N Short leg of more than one Pythagorean triangle.

%C Values of n for which composite n X n magic squares are possible. - _J. Lowell_, May 20 2010

%C If n is in the sequence, k*n is in the sequence for all k > 1. So odd semiprimes (A046315) and numbers of the form 4*p where p is an odd prime are core subsequences which give the initial terms of arithmetic progressions in this sequence. - _Altug Alkan_, Nov 29 2015

%C Numbers appearing more than once in A009004. - _Sean A. Irvine_, Apr 20 2018

%H Robert Israel, <a href="/A009188/b009188.txt">Table of n, a(n) for n = 1..10000</a>

%p filter:= proc(n) not isprime(n) and (n::odd or not isprime(n/2)) end proc:

%p select(filter, [$9 .. 10000]); # _Robert Israel_, Nov 30 2015

%t filterQ[n_] := !PrimeQ[n] && (OddQ[n] || !PrimeQ[n/2]);

%t Select[Range[9, 120], filterQ] (* _Jean-François Alcover_, Feb 28 2019, from Maple *)

%o (PARI) forcomposite(n=9, 1e3, if(n % 2 == 1 || !isprime(n/2), print1(n, ", "))) \\ _Altug Alkan_, Dec 01 2015

%Y Cf. A001749, A009004, A020884, A046315, A264828.

%K nonn

%O 1,1

%A _David W. Wilson_

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 April 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)