OFFSET
1,1
COMMENTS
LINKS
Ely Golden, Table of n, a(n) for n = 1..25
EXAMPLE
MATHEMATICA
Function[w, Flatten@ Map[w[[#]] &, #] &@ Map[First, DeleteCases[#, w_ /; Length@ w == 0]] &@ Map[Position[w, k_ /; PrimeOmega@k == #] &, Range@ 9]]@ Select[Range[10^6], Equal @@ Map[PrimeOmega, {# - 1, #}] &] (* Michael De Vlieger, Dec 01 2016 *)
PROG
(Java) import java.math.BigInteger;
public class A278294{
public static void main(String[] args)throws Exception{
BigInteger dim0=numberOfPrimeFactors(BigInteger.valueOf(2)); //note that this method must be manually implemented by the user
BigInteger dim1;
BigInteger maxdim=BigInteger.ONE;
BigInteger counter=BigInteger.valueOf(3);
long index=1;
while(index<=20){
dim1=numberOfPrimeFactors(counter);
if(dim1.equals(dim0)&&maxdim.testBit(dim1.intValue())==false){System.out.println(dim1+" "+counter); maxdim=maxdim.setBit(dim1.intValue()); index++; }
dim0=dim1;
counter=counter.add(BigInteger.ONE);
}
}
}
(SageMath)
def bigomega(x):
s=0;
f=list(factor(x));
for c in range(len(f)):
s+=f[c][1]
return s;
dim0=bigomega(2);
maxdim=1
counter=3
index=1
while(index<=20):
dim1=bigomega(counter);
if((dim1==dim0)&((maxdim&(1<<dim1))==0)):
print(str(index)+" "+str(counter))
maxdim=maxdim|(1<<dim1);
index+=1;
dim0=dim1;
counter+=1;
CROSSREFS
KEYWORD
nonn
AUTHOR
Ely Golden, Nov 16 2016
STATUS
approved