Sequences
392,541 sequences
- Write n in binary; a(n) = number of 0's in rightmost block of zeros, after dropping any trailing 0's.A089311
Write n in binary; a(n) = number of 0's in rightmost block of zeros, after dropping any trailing 0's.
- Write n in binary; a(n) = number represented by rightmost block of 1's.A089312
Write n in binary; a(n) = number represented by rightmost block of 1's.
- Write n in binary; a(n) = number represented by second block of 1's from the right.A089313
Write n in binary; a(n) = number represented by second block of 1's from the right.
- Sum of all digits in all even numbers from 0 to 444...4 (with n 4's).A089314
Sum of all digits in all even numbers from 0 to 444...4 (with n 4's).
- Prime worms [successive digit differences with absolute value of 3].A089315
Prime worms [successive digit differences with absolute value of 3].
- Prime worms [successive digit differences with absolute value of 2].A089316
Prime worms [successive digit differences with absolute value of 2].
- Prime worms [successive digit differences with absolute value of 4].A089317
Prime worms [successive digit differences with absolute value of 4].
- Smallest prime of the form an n-th power followed by digit 1.A089318
Smallest prime of the form an n-th power followed by digit 1.
- Smallest k > 1 such that k^n followed by digit 1 is a prime.A089319
Smallest k > 1 such that k^n followed by digit 1 is a prime.
- a(1) = 1, a(n) = smallest multiple of n using nonzero digits beginning with the digit reversal of a(n-1), if n is not == 0 (mod 10), else a(10^r*k) =10^r*{digit Reversal of a(10^r*k-1)}.A089320
a(1) = 1, a(n) = smallest multiple of n using nonzero digits beginning with the digit reversal of a(n-1), if n is not == 0 (mod 10), else a(10^r*k) =10^r*{digit Reversal of a(10^r*k-1)}.
- A089320(n)/n.A089321
A089320(n)/n.
- a(0) = 1, then rearrangement of odd multiples of 3 not == 0 (mod 5) such that every partial concatenation (n>1) is a prime.A089322
a(0) = 1, then rearrangement of odd multiples of 3 not == 0 (mod 5) such that every partial concatenation (n>1) is a prime.
- Smallest k such that concatenation of r*k and 1 is a prime for all r = 1 to n, or smallest k such that 10*r*k +1 is a prime for all r = 1 to n.A089323
Smallest k such that concatenation of r*k and 1 is a prime for all r = 1 to n, or smallest k such that 10*r*k +1 is a prime for all r = 1 to n.
- Number of lattice paths from (0,0) to the line x+y=n that use the step set {(0,1),(1,0),(2,0),(3,0),...} and never pass below y=x.A089324
Number of lattice paths from (0,0) to the line x+y=n that use the step set {(0,1),(1,0),(2,0),(3,0),...} and never pass below y=x.
- a(1) = 3, a(n) = smallest multiple of a(n-1) such that 10*a(n) + 1 is prime.A089325
a(1) = 3, a(n) = smallest multiple of a(n-1) such that 10*a(n) + 1 is prime.
- a(n) = A089325(n+1)/A089325(n).A089326
a(n) = A089325(n+1)/A089325(n).
- Smallest prime p such that 10*n*p +1 is prime.A089327
Smallest prime p such that 10*n*p +1 is prime.
- Smallest prime of the form the concatenation r*k for r = 1 to n followed by a 1.A089328
Smallest prime of the form the concatenation r*k for r = 1 to n followed by a 1.
- Smallest k such that the concatenation r*k for r = 1 to n followed by a 1 is a prime.A089329
Smallest k such that the concatenation r*k for r = 1 to n followed by a 1 is a prime.
- a(1) = 1, a(n) = smallest multiple of n such that the concatenation (n>1) a(n)a(n-1)... a(2) a(1) is a prime.A089330
a(1) = 1, a(n) = smallest multiple of n such that the concatenation (n>1) a(n)a(n-1)... a(2) a(1) is a prime.
- a(1) = 1; for n>1, a(n) = smallest power of 2 not included earlier such that the (n>1) concatenation a(n), a(n-1), ...a(2), a(1) is a prime.A089331
a(1) = 1; for n>1, a(n) = smallest power of 2 not included earlier such that the (n>1) concatenation a(n), a(n-1), ...a(2), a(1) is a prime.
- a(n) = floor(10*(primepi((n+1)^2) - primepi(n^2) - 2*n/sqrt(n)+4)).A089332
a(n) = floor(10*(primepi((n+1)^2) - primepi(n^2) - 2*n/sqrt(n)+4)).
- Number of partitions into a square number of parts.A089333
Number of partitions into a square number of parts.
- Beginning with 3, rearrangement of primes such that the concatenation a(n), a(n-1), ...a(2), a(1) is a prime.A089334
Beginning with 3, rearrangement of primes such that the concatenation a(n), a(n-1), ...a(2), a(1) is a prime.
- Smallest number using a single digit with multiplicity such that every partial concatenation is prime.A089335
Smallest number using a single digit with multiplicity such that every partial concatenation is prime.
- Smallest palindrome such that every partial concatenation is prime.A089336
Smallest palindrome such that every partial concatenation is prime.
- a(1) = 1; for n > 1, a(n) is the smallest number that is either a divisor or a multiple, in that priority (order), of a(n-1) such that it is a distinct palindrome not included earlier.A089337
a(1) = 1; for n > 1, a(n) is the smallest number that is either a divisor or a multiple, in that priority (order), of a(n-1) such that it is a distinct palindrome not included earlier.
- Beginning with 3 the smallest number such that the concatenation a(n), a(n-1), ... a(2), a(1) is a prime.A089338
Beginning with 3 the smallest number such that the concatenation a(n), a(n-1), ... a(2), a(1) is a prime.
- Number of primes beginning with n and of the form n concatenated with p where p takes all the prime values less than n.A089339
Number of primes beginning with n and of the form n concatenated with p where p takes all the prime values less than n.
- Index of the first occurrence of n in A089339.A089340
Index of the first occurrence of n in A089339.
- Numbers k with lpf(k) < gpf(k) < 2*lpf(k), where lpf = A020639, gpf = A006530.A089341
Numbers k with lpf(k) < gpf(k) < 2*lpf(k), where lpf = A020639, gpf = A006530.
- Numerator of sqrt(2) * Integral_{x=0..sqrt(1/3)} 1/(1-x^2)^(n+3/2) dx.A089342
Numerator of sqrt(2) * Integral_{x=0..sqrt(1/3)} 1/(1-x^2)^(n+3/2) dx.
- Sum of all digits in all even numbers from 0 to 6(10^(k+1)-1)/9 (with (k+1) 6's).A089343
Sum of all digits in all even numbers from 0 to 6(10^(k+1)-1)/9 (with (k+1) 6's).
- Smallest prime(k) such that prime(k)-prime(k-n) is equal to prime(k+1)-prime(k).A089344
Smallest prime(k) such that prime(k)-prime(k-n) is equal to prime(k+1)-prime(k).
- Primes of the form identical even digits followed by a 1.A089345
Primes of the form identical even digits followed by a 1.
- Primes of the form identical odd digits followed by a 1.A089346
Primes of the form identical odd digits followed by a 1.
- Primes of the form identical digits followed by a 1.A089347
Primes of the form identical digits followed by a 1.
- Primes of the form smallest multiple of n followed by a 1.A089348
Primes of the form smallest multiple of n followed by a 1.
- Triangle read by rows: counts the permutations of partitions described in A083480. Both Arrays have shape sequence A083479.A089349
Triangle read by rows: counts the permutations of partitions described in A083480. Both Arrays have shape sequence A083479.
- Sum of all digits in all even numbers from 0 to 8(10^(k+1)-1)/9 (with (k+1) 8's).A089350
Sum of all digits in all even numbers from 0 to 8(10^(k+1)-1)/9 (with (k+1) 8's).
- Number of planar partitions of n with trace 4.A089351
Number of planar partitions of n with trace 4.
- Numbers that are divisible by the sum of their distinct prime factors (A008472).A089352
Numbers that are divisible by the sum of their distinct prime factors (A008472).
- Triangle read by rows: T(n,m) = number of planar partitions of n with trace m.A089353
Triangle read by rows: T(n,m) = number of planar partitions of n with trace m.
- Number of generalized {(1,2),(1,-1)}-Dyck paths of length 3n with no peaks at level 2.A089354
Number of generalized {(1,2),(1,-1)}-Dyck paths of length 3n with no peaks at level 2.
- A quarter-square shaped (A002620) staircase array distributing the frequency of objects counted by A047970.A089355
A quarter-square shaped (A002620) staircase array distributing the frequency of objects counted by A047970.
- Smallest prime beginning with digit reversal of n and not included earlier.A089356
Smallest prime beginning with digit reversal of n and not included earlier.
- a(n) = 2^(6*n).A089357
a(n) = 2^(6*n).
- Numbers k such that k^2 - 3*k + 3 is prime.A089358
Numbers k such that k^2 - 3*k + 3 is prime.
- Primes which can be partitioned into distinct factorials. 0! and 1! are not considered distinct.A089359
Primes which can be partitioned into distinct factorials. 0! and 1! are not considered distinct.
- Prime worms.A089360
Prime worms.