Sequences
392,541 sequences
- Triangle read by rows, the Bell transform of n!*binomial(5,n) (without column 0).A049411
Triangle read by rows, the Bell transform of n!*binomial(5,n) (without column 0).
- Row sums of triangle A049385.A049412
Row sums of triangle A049385.
- Largest prime dividing Sum_{k=0..n} k! * (n-k)!.A049413
Largest prime dividing Sum_{k=0..n} k! * (n-k)!.
- Number of quasi-initially connected digraphs with n labeled nodes.A049414
Number of quasi-initially connected digraphs with n labeled nodes.
- Number of squares (of positive integers) with n digits.A049415
Number of squares (of positive integers) with n digits.
- Largest number whose square has n digits.A049416
Largest number whose square has n digits.
- a(n) = isigma(n): sum of infinitary divisors of n.A049417
a(n) = isigma(n): sum of infinitary divisors of n.
- 3-i-sigma(n): sum of 3-infinitary divisors of n: if n=Product p(i)^r(i) and d=Product p(i)^s(i), each s(i) has a digit a<=b in its ternary expansion everywhere that the corresponding r(i) has a digit b, then d is a 3-i-divisor of n.A049418
3-i-sigma(n): sum of 3-infinitary divisors of n: if n=Product p(i)^r(i) and d=Product p(i)^s(i), each s(i) has a digit a<=b in its ternary expansion everywhere that the corresponding r(i) has a digit b, then d is a 3-i-divisor of n.
- a(1) = 1; for n > 1, a(n) = number of exponential divisors of n.A049419
a(1) = 1; for n > 1, a(n) = number of exponential divisors of n.
- Composite numbers k such that k!/k# + 1 is prime, where k# = primorial numbers A034386.A049420
Composite numbers k such that k!/k# + 1 is prime, where k# = primorial numbers A034386.
- Composite numbers k such that k!/k# - 1 is prime, where k# = primorial numbers A034386.A049421
Composite numbers k such that k!/k# - 1 is prime, where k# = primorial numbers A034386.
- Numbers k such that k^2 + 3 is prime.A049422
Numbers k such that k^2 + 3 is prime.
- Primes of the form k^2 + 3.A049423
Primes of the form k^2 + 3.
- Triangle read by rows, the Bell transform of n!*binomial(4,n) (without column 0).A049424
Triangle read by rows, the Bell transform of n!*binomial(4,n) (without column 0).
- Row sums of triangle A049404.A049425
Row sums of triangle A049404.
- Row sums of triangle A049410.A049426
Row sums of triangle A049410.
- Row sums of triangle A049424.A049427
Row sums of triangle A049424.
- Row sums of triangle A049411.A049428
Row sums of triangle A049411.
- Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (0 < d < n).A049429
Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (0 < d < n).
- Triangle read by rows: T(n,d) is the number of distinct properly d-dimensional polyominoes (or polycubes) with n cells (n >= 1, d >= 0).A049430
Triangle read by rows: T(n,d) is the number of distinct properly d-dimensional polyominoes (or polycubes) with n cells (n >= 1, d >= 0).
- Duplicate of A049428.A049431
Duplicate of A049428.
- Numbers k such that k! - (k-1)! + 1 is prime.A049432
Numbers k such that k! - (k-1)! + 1 is prime.
- Numbers k such that k! - (k-1)! - 1 is prime.A049433
Numbers k such that k! - (k-1)! - 1 is prime.
- Stirling numbers of second kind: 8th column of Stirling2 triangle A008277.A049434
Stirling numbers of second kind: 8th column of Stirling2 triangle A008277.
- Stirling numbers of second kind: 10th column of Stirling2 triangle A008277.A049435
Stirling numbers of second kind: 10th column of Stirling2 triangle A008277.
- p, p+8 and either p+2 or p+6 or both are all primes.A049436
p, p+8 and either p+2 or p+6 or both are all primes.
- Primes p such that p+2 and p+8 are also primes but p+6 is not.A049437
Primes p such that p+2 and p+8 are also primes but p+6 is not.
- p, p+6 and p+8 are all primes (A046138) but p+2 is not.A049438
p, p+6 and p+8 are all primes (A046138) but p+2 is not.
- Numbers k such that the number of odd divisors of k is an odd divisor of k.A049439
Numbers k such that the number of odd divisors of k is an odd divisor of k.
- a(n) = Fib(3*n)^2 - 2*Fib(3*n) + 4*Fib(3*n+1) + 5, where Fib = A000045.A049440
a(n) = Fib(3*n)^2 - 2*Fib(3*n) + 4*Fib(3*n+1) + 5, where Fib = A000045.
- Numbers n such that n^3 + 3 is prime.A049441
Numbers n such that n^3 + 3 is prime.
- Numbers n such that sum of first n consecutive prime numbers is pandigital (includes all 10 digits exactly once).A049442
Numbers n such that sum of first n consecutive prime numbers is pandigital (includes all 10 digits exactly once).
- Numbers n such that sum of consecutive primes to p is pandigital (includes all 10 digits exactly once).A049443
Numbers n such that sum of consecutive primes to p is pandigital (includes all 10 digits exactly once).
- Generalized Stirling number triangle of first kind.A049444
Generalized Stirling number triangle of first kind.
- Numbers k with the property that the number of 1's in binary expansion of k (see A000120) divides k.A049445
Numbers k with the property that the number of 1's in binary expansion of k (see A000120) divides k.
- Pandigital sums associated with A049442.A049446
Pandigital sums associated with A049442.
- Stirling numbers of second kind: 9th column of Stirling2 triangle A008277.A049447
Stirling numbers of second kind: 9th column of Stirling2 triangle A008277.
- Sum of numerator and denominator of fractions in Farey tree A007305/A007306.A049448
Sum of numerator and denominator of fractions in Farey tree A007305/A007306.
- Product of numerator and denominator of fractions in Farey tree A007305/A007306.A049449
Product of numerator and denominator of fractions in Farey tree A007305/A007306.
- Pentagonal numbers multiplied by 2: a(n) = n*(3*n-1).A049450
Pentagonal numbers multiplied by 2: a(n) = n*(3*n-1).
- Twice second pentagonal numbers.A049451
Twice second pentagonal numbers.
- Pentagonal numbers with even index.A049452
Pentagonal numbers with even index.
- Second pentagonal numbers with even index: a(n) = n*(6*n+1).A049453
Second pentagonal numbers with even index: a(n) = n*(6*n+1).
- a(n) = 1 + Sum_{i=1..n} phi(i)^2.A049454
a(n) = 1 + Sum_{i=1..n} phi(i)^2.
- Triangle read by rows: T(n,k) = numerator of fraction in k-th term of n-th row of variant of Farey series.A049455
Triangle read by rows: T(n,k) = numerator of fraction in k-th term of n-th row of variant of Farey series.
- Triangle T(n,k) = denominator of fraction in k-th term of n-th row of variant of Farey series. This is also Stern's diatomic array read by rows (version 1).A049456
Triangle T(n,k) = denominator of fraction in k-th term of n-th row of variant of Farey series. This is also Stern's diatomic array read by rows (version 1).
- Least positive integer k such that the number having periodic continued fraction [ 1,m,1,m,1,m,... ] is of form (a+b*sqrt(k))/c, where a,b,c are positive integers.A049457
Least positive integer k such that the number having periodic continued fraction [ 1,m,1,m,1,m,... ] is of form (a+b*sqrt(k))/c, where a,b,c are positive integers.
- Generalized Stirling number triangle of first kind.A049458
Generalized Stirling number triangle of first kind.
- Generalized Stirling number triangle of first kind.A049459
Generalized Stirling number triangle of first kind.
- Generalized Stirling number triangle of first kind.A049460
Generalized Stirling number triangle of first kind.