Sequences
392,541 sequences
- Permutation of natural numbers arising from a spiral.A090861
Permutation of natural numbers arising from a spiral.
- Smallest b > 10 such that the decimal representation of the n-th prime is not a prime in base b representation.A090862
Smallest b > 10 such that the decimal representation of the n-th prime is not a prime in base b representation.
- Numbers n such that F(n+1)*F(n-1)*B(2n) is an integer, where F(k)=k-th Fibonacci number and B(2k)=2k-th Bernoulli number.A090863
Numbers n such that F(n+1)*F(n-1)*B(2n) is an integer, where F(k)=k-th Fibonacci number and B(2k)=2k-th Bernoulli number.
- Complement of generalized pentagonal numbers (A001318).A090864
Complement of generalized pentagonal numbers (A001318).
- Primes p such that (p-1)/2 is prime if p == 3 (mod 4) or (p-1)/4 is prime if p == 1 (mod 4).A090865
Primes p such that (p-1)/2 is prime if p == 3 (mod 4) or (p-1)/4 is prime if p == 1 (mod 4).
- Primes p == 1 (mod 4) such that (p-1)/4 is prime.A090866
Primes p == 1 (mod 4) such that (p-1)/4 is prime.
- Number of partitions of n such that the set of even parts has only one element.A090867
Number of partitions of n such that the set of even parts has only one element.
- Number of partitions of n such that the set of odd parts has only one element.A090868
Number of partitions of n such that the set of odd parts has only one element.
- Irregular primes whose indices are irregular primes of order one.A090869
Irregular primes whose indices are irregular primes of order one.
- a(n) is the smallest m such that d(m+k-1) = 2k for k = 1, ..., n where d(t)= prime(t+1) - prime(t) (differences of consecutive primes in arithmetic progression).A090870
a(n) is the smallest m such that d(m+k-1) = 2k for k = 1, ..., n where d(t)= prime(t+1) - prime(t) (differences of consecutive primes in arithmetic progression).
- Numbers k such that the six numbers 1.prime(k).prime(k+1), prime(k).1.prime(k+1), prime(k).prime(k+1).1, 1.prime(k-1).prime(k), prime(k-1).1.prime(k) and prime(k-1).prime(k).1, where "." denotes concatenation, are primes.A090871
Numbers k such that the six numbers 1.prime(k).prime(k+1), prime(k).1.prime(k+1), prime(k).prime(k+1).1, 1.prime(k-1).prime(k), prime(k-1).1.prime(k) and prime(k-1).prime(k).1, where "." denotes concatenation, are primes.
- a(n) is the smallest number m greater than 1 such that m^(2^k)+1 for k=0,1,...,n are primes.A090872
a(n) is the smallest number m greater than 1 such that m^(2^k)+1 for k=0,1,...,n are primes.
- a(n) is the smallest number m such that n^2^k + m^2^k is prime for k=0,1,2,3 and 4.A090873
a(n) is the smallest number m such that n^2^k + m^2^k is prime for k=0,1,2,3 and 4.
- a(n) is the smallest number m such that m^2^k + (m+1)^2^k is prime for k=0..n.A090874
a(n) is the smallest number m such that m^2^k + (m+1)^2^k is prime for k=0..n.
- a(n) is the smallest number m such that m^(2^k) + 2^(2^k) is prime for k=0,1,...,n.A090875
a(n) is the smallest number m such that m^(2^k) + 2^(2^k) is prime for k=0,1,...,n.
- Sum of regular and irregular primes of the same index.A090876
Sum of regular and irregular primes of the same index.
- Difference between irregular and regular primes of the same index.A090877
Difference between irregular and regular primes of the same index.
- Numerator of Integral_{x>=0} exp(-x)*(1+x/n)^n dx.A090878
Numerator of Integral_{x>=0} exp(-x)*(1+x/n)^n dx.
- a(n) = Sum_{d|n} d*2^(n-d).A090879
a(n) = Sum_{d|n} d*2^(n-d).
- Suppose n=(p1^e1)(p2^e2)... where p1,p2,... are the prime numbers and e1,e2,... are nonnegative integers. Then a(n) = e1 + (e2)*3 + (e3)*9 + (e4)*27 + ... + (ek)*(3^(k-1)) + ...A090880
Suppose n=(p1^e1)(p2^e2)... where p1,p2,... are the prime numbers and e1,e2,... are nonnegative integers. Then a(n) = e1 + (e2)*3 + (e3)*9 + (e4)*27 + ... + (ek)*(3^(k-1)) + ...
- Suppose n=(p1^e1)(p2^e2)... where p1,p2,... are the prime numbers and e1,e2,... are nonnegative integers. Then a(n) = e1 + (e2)*4 + (e3)*16 + (e4)*64 + ... + (ek)*(4^(k-1)) + ...A090881
Suppose n=(p1^e1)(p2^e2)... where p1,p2,... are the prime numbers and e1,e2,... are nonnegative integers. Then a(n) = e1 + (e2)*4 + (e3)*16 + (e4)*64 + ... + (ek)*(4^(k-1)) + ...
- Suppose n=(p1^e1)(p2^e2)... where p1,p2,... are the prime numbers and e1,e2,... are nonnegative integers. Then a(n) = e1 + (e2)*5 + (e3)*25 + (e4)*125 + ... + (ek)*(5^(k-1)) + ...A090882
Suppose n=(p1^e1)(p2^e2)... where p1,p2,... are the prime numbers and e1,e2,... are nonnegative integers. Then a(n) = e1 + (e2)*5 + (e3)*25 + (e4)*125 + ... + (ek)*(5^(k-1)) + ...
- Write n as Product_{i=1..k} prime(i)^e_i, where prime(i) is the i-th prime number and e_i is a nonnegative integer. a(n) = Sum_{i=1..k} e_i*n^(i-1).A090883
Write n as Product_{i=1..k} prime(i)^e_i, where prime(i) is the i-th prime number and e_i is a nonnegative integer. a(n) = Sum_{i=1..k} e_i*n^(i-1).
- a(n) is the derivative of n via transport of structure from polynomials. Completely multiplicative with a(2) = 1, a(prime(i+1)) = prime(i)^i for i > 0.A090884
a(n) is the derivative of n via transport of structure from polynomials. Completely multiplicative with a(2) = 1, a(prime(i+1)) = prime(i)^i for i > 0.
- Sum of the squares of the exponents in the prime factorization of n.A090885
Sum of the squares of the exponents in the prime factorization of n.
- Primes in the products of consecutive prime-indexed primes + 2 or A080696(n) + 2.A090886
Primes in the products of consecutive prime-indexed primes + 2 or A080696(n) + 2.
- Irregular primes the indices of whose indices are irregular primes of order two.A090887
Irregular primes the indices of whose indices are irregular primes of order two.
- Matrix defined by a(n,k) = 3^n*Fibonacci(k) - 2^n*Fibonacci(k-2), read by antidiagonals.A090888
Matrix defined by a(n,k) = 3^n*Fibonacci(k) - 2^n*Fibonacci(k-2), read by antidiagonals.
- Double partial sums of (n * its dyadic valuation).A090889
Double partial sums of (n * its dyadic valuation).
- 30*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 11.A090890
30*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 11.
- 30*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 17.A090891
30*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 17.
- Solutions x to equation floor(x*r*floor(x/r)) = floor(x/r*floor(x*r)) when r = sqrt(2).A090892
Solutions x to equation floor(x*r*floor(x/r)) = floor(x/r*floor(x*r)) when r = sqrt(2).
- Solutions x to equation floor(x*r*floor(x/r)) = floor(x/r*floor(x*r)) when r=sqrt(3).A090893
Solutions x to equation floor(x*r*floor(x/r)) = floor(x/r*floor(x*r)) when r=sqrt(3).
- Numbers in n-th downward diagonal of triangle T : 0; 1, 2; 3, 4, 5; 6, 7, 8, 9; ...A090894
Numbers in n-th downward diagonal of triangle T : 0; 1, 2; 3, 4, 5; 6, 7, 8, 9; ...
- a(1)=1 then a(n)=a(n-1)/2 if a(n-1) is even, a(n)=a(n-1)+n otherwise.A090895
a(1)=1 then a(n)=a(n-1)/2 if a(n-1) is even, a(n)=a(n-1)+n otherwise.
- a(n) = sigma^n(n), where sigma^n denotes functional iteration.A090896
a(n) = sigma^n(n), where sigma^n denotes functional iteration.
- Next n digits of Pi.A090897
Next n digits of Pi.
- Index of first occurrence of the first n digits of e in the decimal expansion of Pi.A090898
Index of first occurrence of the first n digits of e in the decimal expansion of Pi.
- Number of nonisomorphic indecomposable self-dual quantum codes on n qubits.A090899
Number of nonisomorphic indecomposable self-dual quantum codes on n qubits.
- Least n-th power such that every concatenation is a prime.A090900
Least n-th power such that every concatenation is a prime.
- a(n) = floor[geometric mean of first n factorials].A090901
a(n) = floor[geometric mean of first n factorials].
- a(n) = floor((product of first n triangular numbers)/(sum of first n factorials)).A090902
a(n) = floor((product of first n triangular numbers)/(sum of first n factorials)).
- Let f(n) be formed by concatenation of first n numbers after the decimal point; a(n) = the n-th digit of 1/f(n) from the most significant side ignoring the decimal point.A090903
Let f(n) be formed by concatenation of first n numbers after the decimal point; a(n) = the n-th digit of 1/f(n) from the most significant side ignoring the decimal point.
- Row products of the irregular triangle defined in A090905.A090904
Row products of the irregular triangle defined in A090905.
- Left side of irregular triangle of natural numbers in which every row product is a multiple of the previous.A090905
Left side of irregular triangle of natural numbers in which every row product is a multiple of the previous.
- Row lengths of the irregular triangle defined in A090905.A090906
Row lengths of the irregular triangle defined in A090905.
- Ratio of products of successive rows of the irregular triangle defined in A090905.A090907
Ratio of products of successive rows of the irregular triangle defined in A090905.
- Terms a(k) of A073869 for which a(k) is distinct from a(k-1).A090908
Terms a(k) of A073869 for which a(k) is distinct from a(k-1).
- Terms a(k) of A073869 for which a(k-1) = a(k), and a(k) and a(k+1) are distinct.A090909
Terms a(k) of A073869 for which a(k-1) = a(k), and a(k) and a(k+1) are distinct.
- a(n+1) is the least positive integer k such that (1) k is a one-digit number or the concatenation of two or more consecutive numbers; (2) |k-a(n)| is prime; (3) k is not already in the sequence; and (4) |k-a(n)| is not the absolute difference of two previous consecutive members of the sequence.A090910
a(n+1) is the least positive integer k such that (1) k is a one-digit number or the concatenation of two or more consecutive numbers; (2) |k-a(n)| is prime; (3) k is not already in the sequence; and (4) |k-a(n)| is not the absolute difference of two previous consecutive members of the sequence.