Sequences
392,541 sequences
- Numbers in sorted order taken from all generations.A048461
Numbers in sorted order taken from all generations.
- Odd numbers in sorted order from generation 2 onwards.A048462
Odd numbers in sorted order from generation 2 onwards.
- Smallest prime occurring in generation n (0 if none).A048463
Smallest prime occurring in generation n (0 if none).
- Indices of primefree generations.A048464
Indices of primefree generations.
- Distinct primes in sorted order from generation 2 onwards.A048465
Distinct primes in sorted order from generation 2 onwards.
- Total number of primes in "generation" n.A048466
Total number of primes in "generation" n.
- a(n) = T(6,n), array T given by A047858.A048467
a(n) = T(6,n), array T given by A047858.
- a(n) = T(7,n), array T given by A047858.A048468
a(n) = T(7,n), array T given by A047858.
- a(n) = T(8,n), array T given by A047858.A048469
a(n) = T(8,n), array T given by A047858.
- a(n) = (n+1)*(2^(n+1) - n)/2.A048470
a(n) = (n+1)*(2^(n+1) - n)/2.
- Array T read by diagonals: T(k,n) = 2^(k-1) * (3^n - 1) + 1.A048471
Array T read by diagonals: T(k,n) = 2^(k-1) * (3^n - 1) + 1.
- Array T by antidiagonals, T(k,n)=(k+1)*n*2^(n-1)+1, n >= 0, k >= 1.A048472
Array T by antidiagonals, T(k,n)=(k+1)*n*2^(n-1)+1, n >= 0, k >= 1.
- a(0)=1, a(n) = 3*a(n-1) + 2; a(n) = 2*3^n - 1.A048473
a(0)=1, a(n) = 3*a(n-1) + 2; a(n) = 2*3^n - 1.
- a(n) = 3*n*2^(n-1) + 1.A048474
a(n) = 3*n*2^(n-1) + 1.
- a(n) is the smallest k at which the number of divisors of binomial(n,k) is maximized.A048475
a(n) is the smallest k at which the number of divisors of binomial(n,k) is maximized.
- a(n) = T(4,n), array T given by A048472.A048476
a(n) = T(4,n), array T given by A048472.
- a(n) = T(5,n), array T given by A048472.A048477
a(n) = T(5,n), array T given by A048472.
- a(n) = T(6,n), array T given by A048472.A048478
a(n) = T(6,n), array T given by A048472.
- a(n) = T(7,n), array T given by A048472.A048479
a(n) = T(7,n), array T given by A048472.
- a(n) = T(8,n), array T given by A048472.A048480
a(n) = T(8,n), array T given by A048472.
- a(n) = T(0,n) + T(1,n-1) + ... + T(n,0), array T given by A048472.A048481
a(n) = T(0,n) + T(1,n-1) + ... + T(n,0), array T given by A048472.
- a(n) = T(n,n), array T given by A048472.A048482
a(n) = T(n,n), array T given by A048472.
- Array read by antidiagonals: T(k,n) = (k+1)2^n - k.A048483
Array read by antidiagonals: T(k,n) = (k+1)2^n - k.
- a(n) = abs(floor(n/2) - A048299(n)).A048484
a(n) = abs(floor(n/2) - A048299(n)).
- a(n) = floor(n/2) - A048475(n).A048485
a(n) = floor(n/2) - A048475(n).
- Values of k for which the earliest maximal value of A001221(C(k,j)) is j = floor(k/2).A048486
Values of k for which the earliest maximal value of A001221(C(k,j)) is j = floor(k/2).
- a(n) = T(4,n), array T given by A048483.A048487
a(n) = T(4,n), array T given by A048483.
- a(n) = 6*2^n - 5.A048488
a(n) = 6*2^n - 5.
- a(n) = 7*2^n - 6.A048489
a(n) = 7*2^n - 6.
- a(n) = T(7,n), array T given by A048483.A048490
a(n) = T(7,n), array T given by A048483.
- a(n) = T(8,n), array T given by A048483.A048491
a(n) = T(8,n), array T given by A048483.
- a(n) = (8*(2^n) - n^2 - 3*n - 6)/2.A048492
a(n) = (8*(2^n) - n^2 - 3*n - 6)/2.
- a(n) = (n+1)*2^n - n.A048493
a(n) = (n+1)*2^n - n.
- Array T(k,n) read by antidiagonals: T(n,k) = 2^(n-1) * ((k+1)*n - 2k) + k + 1.A048494
Array T(k,n) read by antidiagonals: T(n,k) = 2^(n-1) * ((k+1)*n - 2k) + k + 1.
- a(n) = (n-1)*2^n + 2.A048495
a(n) = (n-1)*2^n + 2.
- a(n) = 2^(n-1)*(3*n-4) + 3.A048496
a(n) = 2^(n-1)*(3*n-4) + 3.
- a(n) = 2^(n-1)*(4*n-6) + 4.A048497
a(n) = 2^(n-1)*(4*n-6) + 4.
- a(n) = 2^(n-1)*(5*n-8) + 5.A048498
a(n) = 2^(n-1)*(5*n-8) + 5.
- a(n) = 2^(n-1)*(6*n-10)+6.A048499
a(n) = 2^(n-1)*(6*n-10)+6.
- a(n) = 2^(n-1)*(7*n-12) + 7.A048500
a(n) = 2^(n-1)*(7*n-12) + 7.
- a(n) = 2^(n-1)*(8*n-14) + 8.A048501
a(n) = 2^(n-1)*(8*n-14) + 8.
- a(n) = 2^(n-1)*(9*n-16) + 9.A048502
a(n) = 2^(n-1)*(9*n-16) + 9.
- Expansion of g.f. (1 - 4*x + 6*x^2 - 2*x^3)/((1-x)^3*(1-2*x)^2).A048503
Expansion of g.f. (1 - 4*x + 6*x^2 - 2*x^3)/((1-x)^3*(1-2*x)^2).
- a(n) = T(n,n), array T given by A048494.A048504
a(n) = T(n,n), array T given by A048494.
- Array T read by diagonals, n-th difference of (T(k,n),T(k,n-1),...,T(k,0)) is (k+n)^2, for n=1,2,3,...; k=0,1,2,...A048505
Array T read by diagonals, n-th difference of (T(k,n),T(k,n-1),...,T(k,0)) is (k+n)^2, for n=1,2,3,...; k=0,1,2,...
- a(n) = T(0,n), array T given by A048505.A048506
a(n) = T(0,n), array T given by A048505.
- a(n) = T(2,n), array T given by A048505.A048507
a(n) = T(2,n), array T given by A048505.
- a(n) = T(3,n), array T given by A048505.A048508
a(n) = T(3,n), array T given by A048505.
- a(n) = T(4,n), array T given by A048505.A048509
a(n) = T(4,n), array T given by A048505.
- a(n) = T(5,n), array T given by A048505.A048510
a(n) = T(5,n), array T given by A048505.