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.
%I A081084 #18 Sep 29 2018 10:19:05 %S A081084 8,48,224,960,65024,261120,1046528,4190208,268402688,1073676288, %T A081084 4294836224,17179607040,70368727400448,4503599493152768, %U A081084 18014398241046528,72057593501057024,288230375077969920 %N A081084 Nonsquarefree numbers m such that rad(m+1)=rad(m)+1, where rad(m)=A007947(m) is the squarefree kernel of m. %C A081084 For k >= 3, 2^k*(2^(k-2)-1) is in the sequence if and only if 2^(k-1)-1 and 2^(k-2)-1 are squarefree. So if m is a term, m+1=2^(k-1)-1 is a squarefree number squared. - Lambert Herrgesell (zero815(AT)googlemail.com), Feb 18 2007 %D A081084 J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 48, p. 18, Ellipses, Paris 2008. %e A081084 48 = 2^4*3 is in the sequence because it is not squarefree, its squarefree kernel is 6 and the squarefree kernel of 49 = 7^2 is 7. %p A081084 with(numtheory): rad:=proc(n) local fs, c: fs:=convert(factorset(n),list): c:=nops(fs): product(fs[j],j=1..c) end: b:=proc(n) if mobius(n)=0 and rad(n+1)=rad(n)+1 then n else fi end:seq(b(n),n=1..1000); # _Emeric Deutsch_ %o A081084 (PARI) rad(n)=my(f=factor(n)[,1]);prod(i=1,#f,f[i]) %o A081084 is(n)=!issquarefree(n) && rad(n+1)==rad(n)+1 \\ _Charles R Greathouse IV_, Aug 08 2013 %Y A081084 Cf. A081083, A062503. %K A081084 nonn %O A081084 1,1 %A A081084 _Reinhard Zumkeller_, Mar 04 2003 %E A081084 a(5)-a(8) from _Emeric Deutsch_, Mar 29 2005 %E A081084 Edited and a(9) onwards supplied by Lambert Herrgesell (zero815(AT)googlemail.com), Feb 18 2007