Sequences
392,541 sequences
- Duplicate of A077444.A077461
Duplicate of A077444.
- Prime factor configuration patterns.A077462
Prime factor configuration patterns.
- Number of primes p such that n < p < 2n-2.A077463
Number of primes p such that n < p < 2n-2.
- Stolarsky-Harborth constant; lim inf_{n->oo} F(n)/n^theta, where F(n) is the number of odd binomial coefficients in the first n rows and theta=log(3)/log(2).A077464
Stolarsky-Harborth constant; lim inf_{n->oo} F(n)/n^theta, where F(n) is the number of odd binomial coefficients in the first n rows and theta=log(3)/log(2).
- Values of n such that A006046(n)/n^theta, where theta=log(3)/log(2), is a local minimum, computed according to Harborth's recurrence.A077465
Values of n such that A006046(n)/n^theta, where theta=log(3)/log(2), is a local minimum, computed according to Harborth's recurrence.
- a(n) = A006046(A077465(n)).A077466
a(n) = A006046(A077465(n)).
- Sum of binary digits of A077465(n).A077467
Sum of binary digits of A077465(n).
- Greedy powers of (2/3): Sum_{n>=1} (2/3)^a(n) = 1.A077468
Greedy powers of (2/3): Sum_{n>=1} (2/3)^a(n) = 1.
- Greedy powers of (3/4): Sum_{n>=1} (3/4)^a(n) = 1.A077469
Greedy powers of (3/4): Sum_{n>=1} (3/4)^a(n) = 1.
- Greedy powers of (3/5): Sum_{n>=1} (3/5)^a(n) = 1.A077470
Greedy powers of (3/5): Sum_{n>=1} (3/5)^a(n) = 1.
- Greedy powers of (4/7): Sum_{n>=1} (4/7)^a(n) = 1.A077471
Greedy powers of (4/7): Sum_{n>=1} (4/7)^a(n) = 1.
- Greedy powers of (5/8): Sum_{n>=1} (5/8)^a(n) = 1.A077472
Greedy powers of (5/8): Sum_{n>=1} (5/8)^a(n) = 1.
- Greedy powers of (5/9): Sum_{n>=1} (5/9)^a(n) = 1.A077473
Greedy powers of (5/9): Sum_{n>=1} (5/9)^a(n) = 1.
- Greedy powers of (7/10): Sum_{n>=1} (7/10)^a(n) = 1.A077474
Greedy powers of (7/10): Sum_{n>=1} (7/10)^a(n) = 1.
- Greedy powers of (8/13): Sum_{n>=1} (8/13)^a(n) = 1.A077475
Greedy powers of (8/13): Sum_{n>=1} (8/13)^a(n) = 1.
- Numbers n such that the digital binary sum of n equals core(n), the squarefree part of n.A077476
Numbers n such that the digital binary sum of n equals core(n), the squarefree part of n.
- Least positive integers not excluded by the rule that if n is present then 2n+1 and 3n+1 are not allowed.A077477
Least positive integers not excluded by the rule that if n is present then 2n+1 and 3n+1 are not allowed.
- Rectangular array R read by antidiagonals: R(i,j) is the number of integers k that divide both i and j (i >= 1, j >= 1).A077478
Rectangular array R read by antidiagonals: R(i,j) is the number of integers k that divide both i and j (i >= 1, j >= 1).
- Number of distinct prime factors of numbers m with BigOmega(m) == 0 modulo omega(m).A077479
Number of distinct prime factors of numbers m with BigOmega(m) == 0 modulo omega(m).
- Total number of prime factors of numbers m with bigomega(m) == 0 modulo omega(m) (counted with repetition).A077480
Total number of prime factors of numbers m with bigomega(m) == 0 modulo omega(m) (counted with repetition).
- Quotient A077480(n) / A077479(n).A077481
Quotient A077480(n) / A077479(n).
- Number of self-avoiding walks on square lattice trapped after n steps.A077482
Number of self-avoiding walks on square lattice trapped after n steps.
- Numerator of the probability P(n) of the occurrence of a 2D self-trapping walk of length n.A077483
Numerator of the probability P(n) of the occurrence of a 2D self-trapping walk of length n.
- Probability P(n) of the occurrence of a 2D self-trapping walk of length n: Exponent of 2 in the denominator.A077484
Probability P(n) of the occurrence of a 2D self-trapping walk of length n: Exponent of 2 in the denominator.
- a(1) = 1, then smallest n-digit square which leaves a square at every step if most significant digit and least significant digit are deleted until a one-or two-digit digit square is obtained. a(2n) = 0 if no such square exists. a(2n+1) = 10^2n only if no nontrivial candidate exists.A077485
a(1) = 1, then smallest n-digit square which leaves a square at every step if most significant digit and least significant digit are deleted until a one-or two-digit digit square is obtained. a(2n) = 0 if no such square exists. a(2n+1) = 10^2n only if no nontrivial candidate exists.
- Largest n-digit square which leaves a square at every step if most significant digit and least significant digit are deleted until a one- or two-digit square is obtained. a(2n) = 0 if no such square exists. a(2n+1) = 9*10^2n only if no nontrivial candidate exists.A077486
Largest n-digit square which leaves a square at every step if most significant digit and least significant digit are deleted until a one- or two-digit square is obtained. a(2n) = 0 if no such square exists. a(2n+1) = 9*10^2n only if no nontrivial candidate exists.
- Squares which leave a square at every step if most significant digit and least significant digit are deleted until a one-digit or two-digit square is obtained.A077487
Squares which leave a square at every step if most significant digit and least significant digit are deleted until a one-digit or two-digit square is obtained.
- All possible products in increasing order of two distinct members of the unary sequence 1, 11, 111, 1111, 11111, ...given by A000042.A077488
All possible products in increasing order of two distinct members of the unary sequence 1, 11, 111, 1111, 11111, ...given by A000042.
- a(n) = smallest multiple of 4 with sum of digits = n.A077489
a(n) = smallest multiple of 4 with sum of digits = n.
- a(n) = smallest k such that 4k has a digit sum = n.A077490
a(n) = smallest k such that 4k has a digit sum = n.
- a(n) = smallest k such that 2k has digit sum = n.A077491
a(n) = smallest k such that 2k has digit sum = n.
- a(n) = smallest k such that 5k has a digit sum = n.A077492
a(n) = smallest k such that 5k has a digit sum = n.
- a(n) = smallest multiple of 7 with a digit sum = n.A077493
a(n) = smallest multiple of 7 with a digit sum = n.
- a(n) = smallest k such that the digit sum of 7k is n.A077494
a(n) = smallest k such that the digit sum of 7k is n.
- a(n) = smallest k such that the digit sum of 8k is n.A077495
a(n) = smallest k such that the digit sum of 8k is n.
- Decimal expansion of lim_{n -> infinity} A001699(n)^(1/2^n).A077496
Decimal expansion of lim_{n -> infinity} A001699(n)^(1/2^n).
- Primes of the form 2^r*5^s + 1.A077497
Primes of the form 2^r*5^s + 1.
- Primes of the form 2^r*7^s + 1.A077498
Primes of the form 2^r*7^s + 1.
- Primes of the form 2^r*11^s + 1.A077499
Primes of the form 2^r*11^s + 1.
- Primes of the form 2^r*p^s + 1, where p is an odd prime.A077500
Primes of the form 2^r*p^s + 1, where p is an odd prime.
- a(n) = smallest prime greater than a(n-1) and beginning with n.A077501
a(n) = smallest prime greater than a(n-1) and beginning with n.
- Smallest square greater than the previous term and beginning with n.A077502
Smallest square greater than the previous term and beginning with n.
- Smallest n-digit square beginning with n.A077503
Smallest n-digit square beginning with n.
- Smallest n-digit prime beginning with n.A077504
Smallest n-digit prime beginning with n.
- a(n) = A077504(n) - n*10^d where d = n - number of digits in n.A077505
a(n) = A077504(n) - n*10^d where d = n - number of digits in n.
- Smallest n-digit triangular number beginning with n.A077506
Smallest n-digit triangular number beginning with n.
- Largest n-digit triangular number beginning with n.A077507
Largest n-digit triangular number beginning with n.
- Largest n-digit prime beginning with n.A077508
Largest n-digit prime beginning with n.
- a(n) = (n+1)*10^d - A077508(n) where d = n - number of digits in n.A077509
a(n) = (n+1)*10^d - A077508(n) where d = n - number of digits in n.
- Numbers k such that k + pi(k) is a prime.A077510
Numbers k such that k + pi(k) is a prime.