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 61.A093261
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 61.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 62.A093262
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 62.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 63.A093263
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 63.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 64.A093264
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 64.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 65.A093265
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 65.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 66.A093266
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 66.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 67.A093267
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 67.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 68.A093268
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 68.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 69.A093269
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 69.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 70.A093270
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 70.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 71.A093271
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 71.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 72.A093272
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 72.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 73.A093273
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 73.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 74.A093274
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 74.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 75.A093275
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 75.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 76.A093276
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 76.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 77.A093277
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 77.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 78.A093278
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 78.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 79.A093279
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 79.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 80.A093280
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 80.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 81.A093281
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 81.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 82.A093282
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 82.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 83.A093283
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 83.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 84.A093284
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 84.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 85.A093285
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 85.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 86.A093286
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 86.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 87.A093287
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 87.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 88.A093288
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 88.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 89.A093289
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 89.
- If S*2^k - 3 and S*2^k + 3 are primes for k=0 to 2, then a(n) = S/10.A093290
If S*2^k - 3 and S*2^k + 3 are primes for k=0 to 2, then a(n) = S/10.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 91.A093291
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 91.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 92.A093292
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 92.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 93.A093293
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 93.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 94.A093294
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 94.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 95.A093295
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 95.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 96.A093296
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 96.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 97.A093297
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 97.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 98.A093298
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 98.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 99.A093299
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 99.
- Maximal values of m=a^2+b^2=c^2+d^2 for each x=a+b+c+d=6*p (p=any odd prime).A093300
Maximal values of m=a^2+b^2=c^2+d^2 for each x=a+b+c+d=6*p (p=any odd prime).
- Earliest positive integer having embedded exactly k distinct primes.A093301
Earliest positive integer having embedded exactly k distinct primes.
- a(n) = (a(n-1)+(2n-1))*(2n) with a(0) = 0.A093302
a(n) = (a(n-1)+(2n-1))*(2n) with a(0) = 0.
- a(n) = a(n-1)*(2n-1) + 2n with a(0)=0.A093303
a(n) = a(n-1)*(2n-1) + 2n with a(0)=0.
- ((Cumulative sum A000045) + (A000079)) - A092176.A093304
((Cumulative sum A000045) + (A000079)) - A092176.
- Number of binary necklaces of length n with no subsequence 000.A093305
Number of binary necklaces of length n with no subsequence 000.
- k-th lower twin prime, where k is the n-th Fibonacci number.A093306
k-th lower twin prime, where k is the n-th Fibonacci number.
- k-th upper twin prime, where k is the n-th Fibonacci number.A093307
k-th upper twin prime, where k is the n-th Fibonacci number.
- a(n) = Fibonacci(prime(prime(n))).A093308
a(n) = Fibonacci(prime(prime(n))).
- a(n) = prime(prime(Fibonacci(n))).A093309
a(n) = prime(prime(Fibonacci(n))).
- a(n) is the k-th lower twin prime, where k = n!.A093310
a(n) is the k-th lower twin prime, where k = n!.