Sequences
392,541 sequences
- Number of prime divisors of the partition numbers (counted with multiplicity).A085561
Number of prime divisors of the partition numbers (counted with multiplicity).
- Sum of the nonprime digits of n.A085562
Sum of the nonprime digits of n.
- Sum of the prime digits of n.A085563
Sum of the prime digits of n.
- Primes whose sum of nonprime digits is also prime.A085564
Primes whose sum of nonprime digits is also prime.
- Decimal expansion of lemniscate constant A.A085565
Decimal expansion of lemniscate constant A.
- Duplicate of A076390.A085566
Duplicate of A076390.
- Least m such that the average number of divisors of all integers from 1 to m equals n, or 0 if no such number exists.A085567
Least m such that the average number of divisors of all integers from 1 to m equals n, or 0 if no such number exists.
- Numerator of 2*Sum(C(n,w)/(2*w+1),w=0..n/2-1)+C(n,n/2)/(n+1) if n is even, or of 2*Sum(C(n,w)/(2*w+1),w=0..(n-1)/2) if n is odd.A085568
Numerator of 2*Sum(C(n,w)/(2*w+1),w=0..n/2-1)+C(n,n/2)/(n+1) if n is even, or of 2*Sum(C(n,w)/(2*w+1),w=0..(n-1)/2) if n is odd.
- Denominator of 2*Sum(C(n,w)/(2*w+1),w=0..n/2-1)+C(n,n/2)/(n+1) if n is even, or of 2*Sum(C(n,w)/(2*w+1),w=0..(n-1)/2) if n is odd.A085569
Denominator of 2*Sum(C(n,w)/(2*w+1),w=0..n/2-1)+C(n,n/2)/(n+1) if n is even, or of 2*Sum(C(n,w)/(2*w+1),w=0..(n-1)/2) if n is odd.
- If n mod 2 = 0 then 2*Sum(floor(C(n,w)/(2*w+1)),w=0..n/2-1)+floor(C(n,n/2)/(n+1)) otherwise 2*Sum(floor(C(n,w)/(2*w+1)),w=0..(n-1)/2).A085570
If n mod 2 = 0 then 2*Sum(floor(C(n,w)/(2*w+1)),w=0..n/2-1)+floor(C(n,n/2)/(n+1)) otherwise 2*Sum(floor(C(n,w)/(2*w+1)),w=0..(n-1)/2).
- Numerator of 2*Sum(C(n,w)/w,w=1..n/2-1)+C(n,n/2)/(n/2) if n is even otherwise of 2*Sum(C(n,w)/w,w=1..(n-1)/2).A085571
Numerator of 2*Sum(C(n,w)/w,w=1..n/2-1)+C(n,n/2)/(n/2) if n is even otherwise of 2*Sum(C(n,w)/w,w=1..(n-1)/2).
- Denominator of 2*Sum(C(n,w)/w,w=1..n/2-1)+C(n, n/2)/(n/2) if n is even otherwise of 2*Sum(C(n,w)/w,w=1..(n-1)/2).A085572
Denominator of 2*Sum(C(n,w)/w,w=1..n/2-1)+C(n, n/2)/(n/2) if n is even otherwise of 2*Sum(C(n,w)/w,w=1..(n-1)/2).
- 2*Sum(floor(C(n,w)/w),w=1..n/2-1)+floor(C(n,n/2)/(n/2)) if n is even, otherwise 2*Sum(floor(C(n,w)/w),w=1..(n-1)/2).A085573
2*Sum(floor(C(n,w)/w),w=1..n/2-1)+floor(C(n,n/2)/(n/2)) if n is even, otherwise 2*Sum(floor(C(n,w)/w),w=1..(n-1)/2).
- Least k such that n*(n+1)*(n+2) + k is palindromic.A085574
Least k such that n*(n+1)*(n+2) + k is palindromic.
- Squares whose sum of nonsquare digits is a square.A085575
Squares whose sum of nonsquare digits is a square.
- Array read by antidiagonals: T(n,k) = size of maximal subset of nodes in n X k grid such that there at least 3 edges between any pair of nodes (n >= 1, k >= 1).A085576
Array read by antidiagonals: T(n,k) = size of maximal subset of nodes in n X k grid such that there at least 3 edges between any pair of nodes (n >= 1, k >= 1).
- Size of maximal subset of the n^2 cells in an n X n grid such that there are at least 3 edges between any pair of chosen cells.A085577
Size of maximal subset of the n^2 cells in an n X n grid such that there are at least 3 edges between any pair of chosen cells.
- Array read by antidiagonals: T(m,n) is the number of distinct products ij with 1<=i<=m, i<=j<=n, for m>=1, n>=1.A085578
Array read by antidiagonals: T(m,n) is the number of distinct products ij with 1<=i<=m, i<=j<=n, for m>=1, n>=1.
- See comments lines for definition.A085579
See comments lines for definition.
- a(n) = (n+1)-st digit after decimal point of d, where d = (sqrt((n+1)^2 + 4(n+1)) - (n+1))/2.A085580
a(n) = (n+1)-st digit after decimal point of d, where d = (sqrt((n+1)^2 + 4(n+1)) - (n+1))/2.
- a(n) = floor( prime(n)/log(n) ).A085581
a(n) = floor( prime(n)/log(n) ).
- The number of rectangles (orthogonal or not) with corners on an n X n grid of points.A085582
The number of rectangles (orthogonal or not) with corners on an n X n grid of points.
- Number of (3412,1234)-avoiding involutions in S_n.A085583
Number of (3412,1234)-avoiding involutions in S_n.
- Number of (3412,2341)-, (3412,4123)- and (3412,52341)-avoiding involutions in S_n.A085584
Number of (3412,2341)-, (3412,4123)- and (3412,52341)-avoiding involutions in S_n.
- Squares with exactly one odd digit.A085585
Squares with exactly one odd digit.
- n, n^2 and n^3 all use only even digits.A085586
n, n^2 and n^3 all use only even digits.
- Eventual period of a single cell in rule 90 cellular automaton in a cyclic universe of width n.A085587
Eventual period of a single cell in rule 90 cellular automaton in a cyclic universe of width n.
- Eventual period of a single cell in rule 150 cellular automaton in a cyclic universe of width n.A085588
Eventual period of a single cell in rule 150 cellular automaton in a cyclic universe of width n.
- Maximal cycle lengths in a certain class of one-dimensional cellular automata.A085589
Maximal cycle lengths in a certain class of one-dimensional cellular automata.
- Maximal cycle lengths in a certain class of one-dimensional cellular automata.A085590
Maximal cycle lengths in a certain class of one-dimensional cellular automata.
- Maximal cycle lengths in a certain class of one-dimensional cellular automata.A085591
Maximal cycle lengths in a certain class of one-dimensional cellular automata.
- Maximal cycle lengths in a certain class of one-dimensional cellular automata.A085592
Maximal cycle lengths in a certain class of one-dimensional cellular automata.
- Maximal cycle lengths in a certain class of one-dimensional cellular automata.A085593
Maximal cycle lengths in a certain class of one-dimensional cellular automata.
- Duplicate of A085587.A085594
Duplicate of A085587.
- Maximal cycle lengths in a certain class of one-dimensional cellular automata.A085595
Maximal cycle lengths in a certain class of one-dimensional cellular automata.
- Cycle lengths in a certain class of one-dimensional cellular automata.A085596
Cycle lengths in a certain class of one-dimensional cellular automata.
- Numbers k such that k and k^3 use only odd digits.A085597
Numbers k such that k and k^3 use only odd digits.
- Primes p with same final decimal digit as k, p = prime(k).A085598
Primes p with same final decimal digit as k, p = prime(k).
- Number of pairs of coprimes (n-i,n+i), 1<i<n.A085599
Number of pairs of coprimes (n-i,n+i), 1<i<n.
- Number of simple graphs with 3 edges on n unlabeled vertices.A085600
Number of simple graphs with 3 edges on n unlabeled vertices.
- a(n) = 2 * (4^n + 2^n) + 1.A085601
a(n) = 2 * (4^n + 2^n) + 1.
- Numbers of the form (2n+1)^(2n+1) + 1.A085602
Numbers of the form (2n+1)^(2n+1) + 1.
- (2n)^(2n) + 1.A085603
(2n)^(2n) + 1.
- T(n,k) = highest power of prime(k) dividing n!, read by rows.A085604
T(n,k) = highest power of prime(k) dividing n!, read by rows.
- Resultant of the polynomial x^n-1 and the Chebyshev polynomial of the second kind U_n(x).A085605
Resultant of the polynomial x^n-1 and the Chebyshev polynomial of the second kind U_n(x).
- a(n) = (n-1)^n - 1.A085606
a(n) = (n-1)^n - 1.
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).A085607
Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).
- Index of the smallest prime starting with n.A085608
Index of the smallest prime starting with n.
- Decimal expansion of Sum{p prime>=2} log(p)/(p^2-p+1).A085609
Decimal expansion of Sum{p prime>=2} log(p)/(p^2-p+1).
- Least m ending in 1 such that m^n ends in a string of n 0's followed by the final 1.A085610
Least m ending in 1 such that m^n ends in a string of n 0's followed by the final 1.