Sequences
392,541 sequences
- Number of prime Gaussian integers z=a+bi with |z|<=n.A062711
Number of prime Gaussian integers z=a+bi with |z|<=n.
- Numbers that are n-gons for three or more n's, where n=3,4,5,...,16.A062712
Numbers that are n-gons for three or more n's, where n=3,4,5,...,16.
- Numbers k such that the sum of the digits of k is a prime factor of k.A062713
Numbers k such that the sum of the digits of k is a prime factor of k.
- Minimal length of a sequence with terms from {1, 2, 3, ..., n} which contains, as a subsequence, each possible ordering of the n symbols 1, 2, 3, ..., n.A062714
Minimal length of a sequence with terms from {1, 2, 3, ..., n} which contains, as a subsequence, each possible ordering of the n symbols 1, 2, 3, ..., n.
- Triangle T(i,j) (i >= -1, -1<=j<=i) whose (i,j)-th entry is 1 if j=-1 otherwise binomial(i,j)*2^(i-j).A062715
Triangle T(i,j) (i >= -1, -1<=j<=i) whose (i,j)-th entry is 1 if j=-1 otherwise binomial(i,j)*2^(i-j).
- Number of arrangements of 1,2,..,n*n in an n X n matrix such that each row is increasing or decreasing.A062716
Number of arrangements of 1,2,..,n*n in an n X n matrix such that each row is increasing or decreasing.
- Numbers m such that 6*m+1 is a perfect square.A062717
Numbers m such that 6*m+1 is a perfect square.
- p and p^2 + 6 are both prime.A062718
p and p^2 + 6 are both prime.
- a(n) = floor(Pi^n/n^Pi).A062719
a(n) = floor(Pi^n/n^Pi).
- If n is odd then 2*n else prime(n).A062720
If n is odd then 2*n else prime(n).
- Numbers k such that k is a product of two primes and k-2 is prime.A062721
Numbers k such that k is a product of two primes and k-2 is prime.
- a(n) = ceiling(n/3)*round(n/4).A062722
a(n) = ceiling(n/3)*round(n/4).
- Least common multiple (LCM) of the first n+1 terms of A000792.A062723
Least common multiple (LCM) of the first n+1 terms of A000792.
- a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.A062724
a(n) = floor(tau^n) + 1, where tau = (1 + sqrt(5))/2.
- Write 0, 1, 2, 3, 4, ... in a triangular spiral, then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0, 7, ...A062725
Write 0, 1, 2, 3, 4, ... in a triangular spiral, then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0, 7, ...
- Numbers that do not contain repeated letters when written in Roman numerals.A062726
Numbers that do not contain repeated letters when written in Roman numerals.
- Sum of the divisors of n^n (A000312).A062727
Sum of the divisors of n^n (A000312).
- Second 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n+7)/2.A062728
Second 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n+7)/2.
- Numbers that are not divisible by any prime=p, where either p-2 or p+2 is prime.A062729
Numbers that are not divisible by any prime=p, where either p-2 or p+2 is prime.
- Rows of Pascal's triangle which contain 3 terms in arithmetic progression.A062730
Rows of Pascal's triangle which contain 3 terms in arithmetic progression.
- Sum of divisors of 2*n.A062731
Sum of divisors of 2*n.
- Squares arising in A039770.A062732
Squares arising in A039770.
- Maximal degree of an irreducible representation of the group SL(n,2) (the group of nonsingular n X n matrices over GF(2) ).A062733
Maximal degree of an irreducible representation of the group SL(n,2) (the group of nonsingular n X n matrices over GF(2) ).
- Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2).A062734
Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2).
- Triangular array T(n,k) giving number of weakly connected digraphs with n labeled nodes and k arcs (n >= 1, 0 <= k <= n(n-1)).A062735
Triangular array T(n,k) giving number of weakly connected digraphs with n labeled nodes and k arcs (n >= 1, 0 <= k <= n(n-1)).
- Primes of form Sum_{k=1..n} (prime(k)+1).A062736
Primes of form Sum_{k=1..n} (prime(k)+1).
- Primes p such that 4p-1 is also prime.A062737
Primes p such that 4p-1 is also prime.
- Number of connected labeled relations.A062738
Number of connected labeled relations.
- Odd powerful numbers.A062739
Odd powerful numbers.
- Number of connected labeled graphs with loops.A062740
Number of connected labeled graphs with loops.
- 3 times pentagonal numbers: 3*n*(3*n-1)/2.A062741
3 times pentagonal numbers: 3*n*(3*n-1)/2.
- Index j of prime p(j) such that floor(p(j)/j) = n is first satisfied.A062742
Index j of prime p(j) such that floor(p(j)/j) = n is first satisfied.
- Smallest prime prime(m) such that floor(prime(m)/m) = n.A062743
Smallest prime prime(m) such that floor(prime(m)/m) = n.
- Duplicate of A059968.A062744
Duplicate of A059968.
- Generalized Catalan array FS(3; n,r).A062745
Generalized Catalan array FS(3; n,r).
- Coefficient array for certain polynomials N(3; k,x) (rising powers of x).A062746
Coefficient array for certain polynomials N(3; k,x) (rising powers of x).
- Row sums of (unsigned) staircase array A062746.A062747
Row sums of (unsigned) staircase array A062746.
- Fourth column (r=3) of FS(3) staircase array A062745.A062748
Fourth column (r=3) of FS(3) staircase array A062745.
- Sixth column (r=5) of FS(3) staircase array A062745.A062749
Sixth column (r=5) of FS(3) staircase array A062745.
- Generalized Catalan array FS(4; n,r).A062750
Generalized Catalan array FS(4; n,r).
- Coefficient array for certain polynomials N(4; k,x) (rising powers in x).A062751
Coefficient array for certain polynomials N(4; k,x) (rising powers in x).
- Row sums of unsigned N(4) staircase array A062751.A062752
Row sums of unsigned N(4) staircase array A062751.
- Multiples of 4 whose sum of digits is also a multiple of 4.A062753
Multiples of 4 whose sum of digits is also a multiple of 4.
- a(n) = gcd(n, sigma(n+1)).A062754
a(n) = gcd(n, sigma(n+1)).
- a(n) = sigma_n(n^2): sum of n-th powers of divisors of n^2.A062755
a(n) = sigma_n(n^2): sum of n-th powers of divisors of n^2.
- Number of 1's in ternary (base-3) expansion of n.A062756
Number of 1's in ternary (base-3) expansion of n.
- Denominator of sum of first n terms of the series 1/15 + 1/63 + 1/80 ... in which the denominators are perfect squares - 1 which are simultaneously other powers, e.g. a(1) = 15 because 16 = 4^2 = 2^4, a perfect square that is also a fourth power; hence 16-1 = 15 qualifies as a term.A062757
Denominator of sum of first n terms of the series 1/15 + 1/63 + 1/80 ... in which the denominators are perfect squares - 1 which are simultaneously other powers, e.g. a(1) = 15 because 16 = 4^2 = 2^4, a perfect square that is also a fourth power; hence 16-1 = 15 qualifies as a term.
- Product of squares of divisors of n.A062758
Product of squares of divisors of n.
- Largest power of squarefree kernel of n (= A007947) which divides n.A062759
Largest power of squarefree kernel of n (= A007947) which divides n.
- a(n) is n divided by the largest power of the squarefree kernel of n (A007947) which divides it.A062760
a(n) is n divided by the largest power of the squarefree kernel of n (A007947) which divides it.