a(n) is the sum of a sequence of multiples of the n-th prime such that it contains each of the digits from 0 to 9 exactly once and with the least sum possible, or 0 if there is no satisfying sequence.
A274328
a(n) is the sum of a sequence of multiples of the n-th prime such that it contains each of the digits from 0 to 9 exactly once and with the least sum possible, or 0 if there is no satisfying sequence.
Terms
- a(0) =270a(1) =135a(2) =38475a(3) =252a(4) =1881a(5) =702a(6) =918a(7) =684a(8) =1656a(9) =2349a(10) =1953a(11) =7326a(12) =2952a(13) =2322a(14) =2961a(15) =3339a(16) =3717a(17) =3843a(18) =3015a(19) =3195a(20) =3285a(21) =5688a(22) =8217a(23) =5607a(24) =4365a(25) =95445a(26) =6489a(27) =4815a(28) =3924a(29) =37629
External references
- oeis: A274328