1,1

E.g. divisors of 45050 are (1,2,3,10,4505,13414,22323,45050); the numbers of digits (0-5) are [ 0(4),1(4),2(4),3(4),4(4),5(4) ]

N. Nomoto, In the list of divisors of n,...

k := 0:for i from 1 to 35000 do for j from 0 to 5 do a[j] := 0:end do:c := divisors(i):for j from 1 to nops(c) do b := convert(c[j], base, 6); for h from 1 to nops(b) do a[ b[h] ] := a[ b[h] ]+1:end do:end do:if(a[0]=a[1] and a[1]=a[2] and a[2]=a[3] and a[4]=a[5]) then k := k+1:q := convert(i, base, 6):d[k] := sum(q[o+1]*10^o, o=0..nops(q)-1):end if:end do: q := seq(d[l], l=1..k);

isA045815 := proc(n) local c, j, b, h, a, q ; a := [0, 0, 0, 0, 0, 0] : c := numtheory[divisors](n): for j from 1 to nops(c) do b := convert(c[j], base, 6); for h from 1 to nops(b) do a[b[h]+1] := a[b[h]+1]+1: end do: end do: if(a[1]=a[2] and a[2]=a[3] and a[3]=a[4] and a[4]=a[5] and a[5]=a[6]) then q := convert(n, base, 6) ; add(q[o+1]*10^o, o=0..nops(q)-1) ; else -1 ; end if: end: n := 1: while true do a := isA045815(n) : if a >= 0 then printf("%d, ", a) ; fi ; n := n+1 : od : - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 26 2007

Cf. A038564, A038565, A045816.

Sequence in context: A053073 A133527 A031825 this_sequence A103912 A082254 A059050

Adjacent sequences: A045812 A045813 A045814 this_sequence A045816 A045817 A045818

easy,nonn,base

Naohiro Nomoto (6284968128(AT)geocities.co.jp)

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Mar 24 2002

Corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 26 2007