Sequences
392,541 sequences
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 11.A093211
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 11.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 12.A093212
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 12.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 13.A093213
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 13.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 14.A093214
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 14.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 15.A093215
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 15.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 16.A093216
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 16.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 17.A093217
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 17.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 18.A093218
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 18.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 19.A093219
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 19.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 20.A093220
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 20.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 21.A093221
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 21.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 22.A093222
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 22.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 23.A093223
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 23.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 24.A093224
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 24.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 25.A093225
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 25.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 26.A093226
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 26.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 27.A093227
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 27.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 28.A093228
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 28.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 29.A093229
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 29.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 30.A093230
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 30.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 31.A093231
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 31.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 32.A093232
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 32.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 33.A093233
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 33.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 34.A093234
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 34.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 35.A093235
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 35.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 36.A093236
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 36.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 37.A093237
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 37.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 38.A093238
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 38.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 39.A093239
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 39.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 40.A093240
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 40.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 41.A093241
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 41.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 42.A093242
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 42.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 43.A093243
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 43.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 44.A093244
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 44.
- a(n) is the lesser term of the smallest twin prime pair such that if P=(a(n)^2+n)^2+n, then P and P+2 are also twin primes. a(n) is 0 if no such pair exists.A093245
a(n) is the lesser term of the smallest twin prime pair such that if P=(a(n)^2+n)^2+n, then P and P+2 are also twin primes. a(n) is 0 if no such pair exists.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 46.A093246
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 46.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 47.A093247
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 47.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 48.A093248
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 48.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 49.A093249
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 49.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 50.A093250
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 50.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 51.A093251
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 51.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 52.A093252
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 52.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 53.A093253
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 53.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 54.A093254
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 54.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 55.A093255
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 55.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 56.A093256
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 56.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 57.A093257
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 57.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 58.A093258
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 58.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 59.A093259
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 59.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 60.A093260
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 60.