A036326 Composite numbers n such that juxtaposition of prime factors of n has length 2.
4, 6, 9, 10, 14, 15, 21, 25, 35, 49
Offset: 1
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.
isA036327 := proc(n) local d: d:=ifactors(n)[2]: return `if`(not isprime(n) and add(length(d[j][1])*d[j][2], j=1..nops(d))=3, n, NULL): end: seq(isA036327(n),n=2..999); # Nathaniel Johnston, Jun 22 2011
isA036333 := proc(n) local d: d:=ifactors(n)[2]: return `if`(not isprime(n) and add(length(d[j][1])*d[j][2], j=1..nops(d))=9, n, NULL): end: seq(isA036333(n),n=2..5440); # Nathaniel Johnston, Jun 22 2011
jpf9Q[n_]:=CompositeQ[n]&&Total[IntegerLength[#[[1]]]#[[2]]&/@ FactorInteger[ n]]==9; Select[ Range[6000],jpf9Q] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Jul 26 2017 *)
isA036328 := proc(n) local d: d:=ifactors(n)[2]: return `if`(not isprime(n) and add(length(d[j][1])*d[j][2], j=1..nops(d))=4, n, NULL): end: l:=[seq(isA036328(n),n=2..9999)]; # Nathaniel Johnston, Jun 22 2011
jpf4Q[n_]:=Length[Flatten[IntegerDigits/@Table[#[[1]],{#[[2]]}]&/@FactorInteger[n]]]==4; Select[Range[300],jpf4Q] (* Harvey P. Dale, Dec 05 2015 *)
isA036329 := proc(n) local d: d:=ifactors(n)[2]: return `if`(not isprime(n) and add(length(d[j][1])*d[j][2], j=1..nops(d))=5, n, NULL): end: l:=[seq(isA036329(n),n=2..378)]; # Nathaniel Johnston, Jun 22 2011
jpf5Q[n_]:=Total[Flatten[Table[IntegerLength[#[[1]]],{#[[2]]}]&/@ FactorInteger[ n]]]==5; Select[Range[400],CompositeQ[#]&&jpf5Q[#]&] (* Harvey P. Dale, Jan 09 2015 *)
isA036330 := proc(n) local d: d:=ifactors(n)[2]: return `if`(not isprime(n) and add(length(d[j][1])*d[j][2], j=1..nops(d))=6, n, NULL): end: seq(isA036330(n),n=2..752); # Nathaniel Johnston, Jun 22 2011
pf6Q[n_]:=!PrimeQ[n]&&Total[Last[#]IntegerLength[First[#]]&/@FactorInteger[ n]]==6; Select[Range[800],pf6Q] (* Harvey P. Dale, Jun 19 2012 *)
isA036331 := proc(n) local d: d:=ifactors(n)[2]: return `if`(not isprime(n) and add(length(d[j][1])*d[j][2], j=1..nops(d))=7, n, NULL): end: seq(isA036331(n),n=2..1452); # Nathaniel Johnston, Jun 22 2011
isA036332 := proc(n) local d: d:=ifactors(n)[2]: return `if`(not isprime(n) and add(length(d[j][1])*d[j][2], j=1..nops(d))=8, n, NULL): end: seq(isA036332(n),n=2..2736); # Nathaniel Johnston, Jun 22 2011
Comments