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.

A069148 Numbers k such that k*k!/A062758(k) is not an integer where A062758(k) is the product of squares of divisors of k.

This page as a plain text file.
%I A069148 #16 Jul 07 2022 08:11:58
%S A069148 4,6,8,10,14,16,18,20,22,26,28,34,38,42,44,46,52,58,62,66,68,74,76,78,
%T A069148 82,86,92,94,102,106,114,116,118,122,124,134,138,142,146,148,158,164,
%U A069148 166,172,174,178,186,188,194,202,206,212,214,218,222,226,236,244,246
%N A069148 Numbers k such that k*k!/A062758(k) is not an integer where A062758(k) is the product of squares of divisors of k.
%H A069148 Amiram Eldar, <a href="/A069148/b069148.txt">Table of n, a(n) for n = 1..10000</a>
%t A069148 Rest[Position[Table[(n*n!)/(Times@@Divisors[n])^2,{n,250}],_?(!IntegerQ[ #]&)]//Flatten] (* _Harvey P. Dale_, Apr 24 2019 *)
%t A069148 Select[Range[250], !Divisible[#!, #^(DivisorSigma[0, #] - 1)] &] (* _Amiram Eldar_, Jul 07 2022 *)
%o A069148 (PARI) for(n=1,320,if((n*(n!))%(n^numdiv(n))>0,print1(n,",")))
%Y A069148 Complement of A069149.
%Y A069148 Cf. A001563 (n*n!), A062758.
%K A069148 easy,nonn
%O A069148 1,1
%A A069148 _Benoit Cloitre_, Apr 08 2002