Sequences

392,541 sequences

a(n)=least k such that base 10 representation of n begins at s(k), where s=A031310.A031311
a(n)=least k such that base 10 representation of n begins at s(k), where s=A031310.
Successive digits of odd numbers.A031312
Successive digits of odd numbers.
Position of n-th 0 in A031312.A031313
Position of n-th 0 in A031312.
Position of n-th 1 in A031312.A031314
Position of n-th 1 in A031312.
Position of n-th 2 in A031312.A031315
Position of n-th 2 in A031312.
Position of n-th 3 in A031312.A031316
Position of n-th 3 in A031312.
Position of n-th 4 in A031312.A031317
Position of n-th 4 in A031312.
Position of n-th 5 in A031312.A031318
Position of n-th 5 in A031312.
Position of n-th 6 in A031312.A031319
Position of n-th 6 in A031312.
Position of n-th 7 in A031312.A031320
Position of n-th 7 in A031312.
Position of n-th 8 in A031312.A031321
Position of n-th 8 in A031312.
Position of n-th 9 in A031312.A031322
Position of n-th 9 in A031312.
Least k such that base 10 representation of n begins at s(k), where s=A031312.A031323
Least k such that base 10 representation of n begins at s(k), where s=A031312.
Decimal digits of successive Fibonacci numbers.A031324
Decimal digits of successive Fibonacci numbers.
Position of n-th 0 in A031324.A031325
Position of n-th 0 in A031324.
Position of n-th 1 in A031324.A031326
Position of n-th 1 in A031324.
Position of n-th 2 in A031324.A031327
Position of n-th 2 in A031324.
Position of n-th 3 in A031324.A031328
Position of n-th 3 in A031324.
Position of n-th 4 in A031324.A031329
Position of n-th 4 in A031324.
Position of n-th 5 in A031324.A031330
Position of n-th 5 in A031324.
Position of n-th 6 in A031324.A031331
Position of n-th 6 in A031324.
Position of n-th 7 in A031324.A031332
Position of n-th 7 in A031324.
Position of n-th 8 in A031324.A031333
Position of n-th 8 in A031324.
Position of n-th 9 in A031324.A031334
Position of n-th 9 in A031324.
a(n)=least k such that n begins at s(k), where s=A031324.A031335
a(n)=least k such that n begins at s(k), where s=A031324.
a(n) = prime(3*n).A031336
a(n) = prime(3*n).
a(n) = prime(4*n).A031337
a(n) = prime(4*n).
a(n) = prime(5*n).A031338
a(n) = prime(5*n).
a(n) = prime(6*n).A031339
a(n) = prime(6*n).
a(n) = prime(7*n).A031340
a(n) = prime(7*n).
a(n) = prime(8*n).A031341
a(n) = prime(8*n).
a(n) = prime(9*n).A031342
a(n) = prime(9*n).
a(n) = prime(10*n).A031343
a(n) = prime(10*n).
Write primes in base 10 but interpret as if in base 12.A031344
Write primes in base 10 but interpret as if in base 12.
Write primes in base 10 but interpret as if in base 13.A031345
Write primes in base 10 but interpret as if in base 13.
Multiplicative persistence: number of iterations of "multiply digits" needed to reach a number < 10.A031346
Multiplicative persistence: number of iterations of "multiply digits" needed to reach a number < 10.
Multiplicative digital root of n (keep multiplying digits of n until reaching a single digit).A031347
Multiplicative digital root of n (keep multiplying digits of n until reaching a single digit).
2-multiplicative persistence: number of iterations of "multiply 2nd powers of digits" needed to reach 0 or 1.A031348
2-multiplicative persistence: number of iterations of "multiply 2nd powers of digits" needed to reach 0 or 1.
3-multiplicative persistence: number of iterations of "multiply 3rd powers of digits" needed to reach 0 or 1.A031349
3-multiplicative persistence: number of iterations of "multiply 3rd powers of digits" needed to reach 0 or 1.
4-multiplicative persistence: number of iterations of "multiply 4th powers of digits" needed to reach 0 or 1.A031350
4-multiplicative persistence: number of iterations of "multiply 4th powers of digits" needed to reach 0 or 1.
5-multiplicative persistence: number of iterations of "multiply 5th powers of digits" needed to reach 0 or 1.A031351
5-multiplicative persistence: number of iterations of "multiply 5th powers of digits" needed to reach 0 or 1.
6-multiplicative persistence: number of iterations of "multiply 6th powers of digits" needed to reach 0 or 1.A031352
6-multiplicative persistence: number of iterations of "multiply 6th powers of digits" needed to reach 0 or 1.
7-multiplicative persistence: number of iterations of "multiply 7th powers of digits" needed to reach 0 or 1.A031353
7-multiplicative persistence: number of iterations of "multiply 7th powers of digits" needed to reach 0 or 1.
8-multiplicative persistence: number of iterations of "multiply 8th powers of digits" needed to reach 0 or 1.A031354
8-multiplicative persistence: number of iterations of "multiply 8th powers of digits" needed to reach 0 or 1.
9-multiplicative persistence: number of iterations of "multiply 9th powers of digits" needed to reach 0 or 1.A031355
9-multiplicative persistence: number of iterations of "multiply 9th powers of digits" needed to reach 0 or 1.
10-multiplicative persistence: number of iterations of "multiply 10th powers of digits" needed to reach 0 or 1.A031356
10-multiplicative persistence: number of iterations of "multiply 10th powers of digits" needed to reach 0 or 1.
Numbers having period-2 6-digitized sequences.A031357
Numbers having period-2 6-digitized sequences.
Number of coincidence site lattices of index 4n+1 in lattice Z^2.A031358
Number of coincidence site lattices of index 4n+1 in lattice Z^2.
Bisection of A001615.A031359
Bisection of A001615.
Number of symmetrically inequivalent coincidence rotations of index 2n-1 in lattice D_4.A031360
Number of symmetrically inequivalent coincidence rotations of index 2n-1 in lattice D_4.