Sequences
392,541 sequences
- Numbers k such that 2*3^k + 5 is prime.A057911
Numbers k such that 2*3^k + 5 is prime.
- Numbers k such that 3*2^k - 5 is prime.A057912
Numbers k such that 3*2^k - 5 is prime.
- Numbers k such that 3*2^k + 5 is prime.A057913
Numbers k such that 3*2^k + 5 is prime.
- Numbers k such that 2*5^k + 3 is prime.A057914
Numbers k such that 2*5^k + 3 is prime.
- Numbers k such that 2*5^k - 3 is prime.A057915
Numbers k such that 2*5^k - 3 is prime.
- Numbers k such that 3*5^k + 2 is prime.A057916
Numbers k such that 3*5^k + 2 is prime.
- Numbers k such that 3*5^k - 2 is prime.A057917
Numbers k such that 3*5^k - 2 is prime.
- Number of pairs of numbers (r,s) each less than n such that (r,s,n) is in geometric progression.A057918
Number of pairs of numbers (r,s) each less than n such that (r,s,n) is in geometric progression.
- Numbers k such that phi(k) divides phi(k+1), where phi(k) is the Euler totient function A000010.A057919
Numbers k such that phi(k) divides phi(k+1), where phi(k) is the Euler totient function A000010.
- Numbers k such that phi(k+1) divides phi(k), where phi is A000010.A057920
Numbers k such that phi(k+1) divides phi(k), where phi is A000010.
- d(n+1) divides d(n), where d(n) is number of positive divisors of n.A057921
d(n+1) divides d(n), where d(n) is number of positive divisors of n.
- d(n) divides d(n+1), where d(n) is number of positive divisors of n.A057922
d(n) divides d(n+1), where d(n) is number of positive divisors of n.
- a(0)=0, a(1)=2, a(n) = smallest number such that sequence b(n) = {a(n-1) BITWISE OR a(n)} is strictly monotonically increasing.A057923
a(0)=0, a(1)=2, a(n) = smallest number such that sequence b(n) = {a(n-1) BITWISE OR a(n)} is strictly monotonically increasing.
- Sequence b(n) mentioned in A057923.A057924
Sequence b(n) mentioned in A057923.
- Position of first occurrence of 2^n in A057923.A057925
Position of first occurrence of 2^n in A057923.
- a(0) = 1, a(1) = 3, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing.A057926
a(0) = 1, a(1) = 3, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing.
- Sequence b(n) mentioned in A057926.A057927
Sequence b(n) mentioned in A057926.
- Position at which 2^n occurs in A057926, or -1 if it does not occur.A057928
Position at which 2^n occurs in A057926, or -1 if it does not occur.
- a(0)=2, a(1)=5, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing.A057929
a(0)=2, a(1)=5, a(n) = smallest number such that sequence b(n) = a(n) OR a(n+1) is strictly monotonically increasing.
- Sequence b(n) mentioned in A057929.A057930
Sequence b(n) mentioned in A057929.
- Positions at which powers of 2 occur in A057929. (Or -1 if it does not occur.)A057931
Positions at which powers of 2 occur in A057929. (Or -1 if it does not occur.)
- a(n) = floor(10^(n+1)/81).A057932
a(n) = floor(10^(n+1)/81).
- Floor[(80/81)*10^n].A057933
Floor[(80/81)*10^n].
- Number of prime factors of 10^n + 1 (counted with multiplicity).A057934
Number of prime factors of 10^n + 1 (counted with multiplicity).
- Number of prime factors of 9^n + 1 (counted with multiplicity).A057935
Number of prime factors of 9^n + 1 (counted with multiplicity).
- Number of prime factors of 8^n + 1 (counted with multiplicity).A057936
Number of prime factors of 8^n + 1 (counted with multiplicity).
- Number of prime factors of 7^n + 1 (counted with multiplicity).A057937
Number of prime factors of 7^n + 1 (counted with multiplicity).
- Number of prime factors of 6^n + 1 (counted with multiplicity).A057938
Number of prime factors of 6^n + 1 (counted with multiplicity).
- Number of prime factors of 5^n + 1 (counted with multiplicity).A057939
Number of prime factors of 5^n + 1 (counted with multiplicity).
- Number of prime factors of 4^n + 1 (counted with multiplicity).A057940
Number of prime factors of 4^n + 1 (counted with multiplicity).
- Number of prime factors of 3^n + 1 (counted with multiplicity).A057941
Number of prime factors of 3^n + 1 (counted with multiplicity).
- Pseudoprimes k to base 2 such that k-2 and k+2 are primes.A057942
Pseudoprimes k to base 2 such that k-2 and k+2 are primes.
- Numbers k such that the smallest palindromic pseudoprime to base k is 101101.A057943
Numbers k such that the smallest palindromic pseudoprime to base k is 101101.
- Largest triangular number less than or equal to n; write m-th triangular number m+1 times.A057944
Largest triangular number less than or equal to n; write m-th triangular number m+1 times.
- Number of triangular numbers needed to represent n with greedy algorithm.A057945
Number of triangular numbers needed to represent n with greedy algorithm.
- Bad hexadecimal notation for n: write n in hexadecimal notation, replacing digit ten with "10", digit eleven with "11", ... and digit fifteen with "15".A057946
Bad hexadecimal notation for n: write n in hexadecimal notation, replacing digit ten with "10", digit eleven with "11", ... and digit fifteen with "15".
- n has ambiguous representations in "bad hexadecimal": numbers with the digit 1 followed by a digit less than 6.A057947
n has ambiguous representations in "bad hexadecimal": numbers with the digit 1 followed by a digit less than 6.
- S-primes: let S = {1,5,9, ... 4i+1, ...}; then an S-prime is in S but is not divisible by any members of S except itself and 1.A057948
S-primes: let S = {1,5,9, ... 4i+1, ...}; then an S-prime is in S but is not divisible by any members of S except itself and 1.
- Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.A057949
Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.
- Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition.A057950
Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition.
- Number of prime factors of 10^n - 1 (counted with multiplicity).A057951
Number of prime factors of 10^n - 1 (counted with multiplicity).
- Number of prime factors of 9^n - 1 (counted with multiplicity).A057952
Number of prime factors of 9^n - 1 (counted with multiplicity).
- Number of prime factors of 8^n - 1 (counted with multiplicity).A057953
Number of prime factors of 8^n - 1 (counted with multiplicity).
- Number of prime factors of 7^n - 1 (counted with multiplicity).A057954
Number of prime factors of 7^n - 1 (counted with multiplicity).
- Number of prime factors of 6^n - 1 (counted with multiplicity).A057955
Number of prime factors of 6^n - 1 (counted with multiplicity).
- Number of prime factors of 5^n - 1 (counted with multiplicity).A057956
Number of prime factors of 5^n - 1 (counted with multiplicity).
- Number of prime factors of 4^n - 1 (counted with multiplicity).A057957
Number of prime factors of 4^n - 1 (counted with multiplicity).
- Number of prime factors of 3^n - 1 (counted with multiplicity).A057958
Number of prime factors of 3^n - 1 (counted with multiplicity).
- Sum of composite numbers up to n is palindromic.A057959
Sum of composite numbers up to n is palindromic.
- Number of base-5 (n+1)-digit numbers starting with a zero and with adjacent digits differing by one or less.A057960
Number of base-5 (n+1)-digit numbers starting with a zero and with adjacent digits differing by one or less.