Sequences
392,541 sequences
- Length of n-th term of A061074, or 0 if no term of A061074 of length n.A061311
Length of n-th term of A061074, or 0 if no term of A061074 of length n.
- Triangle T[n,m]: T[n,-1] = 0; T[0,0] = 0; T[n,0] = n*n!; T[n,m] = T[n,m-1] - T[n-1,m-1].A061312
Triangle T[n,m]: T[n,-1] = 0; T[0,0] = 0; T[n,0] = n*n!; T[n,m] = T[n,m-1] - T[n-1,m-1].
- Minimal number of steps to get from 1 to n by (a) subtracting 1 or (b) multiplying by 2.A061313
Minimal number of steps to get from 1 to n by (a) subtracting 1 or (b) multiplying by 2.
- Table read by descending antidiagonals where T(n,k) = T(n,k-1) + T(n,k-1)^2/k^2 and T(n,0)=n.A061314
Table read by descending antidiagonals where T(n,k) = T(n,k-1) + T(n,k-1)^2/k^2 and T(n,0)=n.
- Array read by antidiagonals: T(n,k)=T(n,k-1)*(T(n,k-1)+k-1)/k with T(n,1)=n.A061315
Array read by antidiagonals: T(n,k)=T(n,k-1)*(T(n,k-1)+k-1)/k with T(n,1)=n.
- a(n) = n*(n+1)*(n^2 + n + 4)/4.A061316
a(n) = n*(n+1)*(n^2 + n + 4)/4.
- Split positive integers into extending even groups and sum: 1+2, 3+4+5+6, 7+8+9+10+11+12, 13+14+15+16+17+18+19+20, ...A061317
Split positive integers into extending even groups and sum: 1+2, 3+4+5+6, 7+8+9+10+11+12, 13+14+15+16+17+18+19+20, ...
- Column 3 of A061314.A061318
Column 3 of A061314.
- Column 4 of A061315.A061319
Column 4 of A061315.
- Column 4 of A061314.A061320
Column 4 of A061314.
- Column 5 of A061315.A061321
Column 5 of A061315.
- a(n) = a(n-1) * (1 + a(n-1)/n^2) with a(0) = 2.A061322
a(n) = a(n-1) * (1 + a(n-1)/n^2) with a(0) = 2.
- Primes with 10 as smallest positive primitive root.A061323
Primes with 10 as smallest positive primitive root.
- Primes with 11 as smallest positive primitive root.A061324
Primes with 11 as smallest positive primitive root.
- Primes with 12 as smallest positive primitive root.A061325
Primes with 12 as smallest positive primitive root.
- Primes with 13 as smallest positive primitive root.A061326
Primes with 13 as smallest positive primitive root.
- Primes with 14 as smallest positive primitive root.A061327
Primes with 14 as smallest positive primitive root.
- Primes with 15 as smallest positive primitive root.A061328
Primes with 15 as smallest positive primitive root.
- Primes with 17 as smallest positive primitive root.A061329
Primes with 17 as smallest positive primitive root.
- Primes with 18 as smallest positive primitive root.A061330
Primes with 18 as smallest positive primitive root.
- Primes with 19 as smallest positive primitive root.A061331
Primes with 19 as smallest positive primitive root.
- Primes with 20 as smallest positive primitive root.A061332
Primes with 20 as smallest positive primitive root.
- Primes with 21 as smallest positive primitive root.A061333
Primes with 21 as smallest positive primitive root.
- Primes with 22 as smallest positive primitive root.A061334
Primes with 22 as smallest positive primitive root.
- Primes with 23 as smallest positive primitive root.A061335
Primes with 23 as smallest positive primitive root.
- Smallest number of triangular numbers which sum to n.A061336
Smallest number of triangular numbers which sum to n.
- Smallest number of distinct triangular numbers which sum to n (or -1 if not possible).A061337
Smallest number of distinct triangular numbers which sum to n (or -1 if not possible).
- Increase in maximal number of comparisons for sorting n elements by list merging.A061338
Increase in maximal number of comparisons for sorting n elements by list merging.
- Minimal number of steps to get from 0 to n by (a) adding 1 or (b) subtracting 1 or (c) multiplying by 2.A061339
Minimal number of steps to get from 0 to n by (a) adding 1 or (b) subtracting 1 or (c) multiplying by 2.
- a(n) = n*omega(n)^n where omega(n) is the number of distinct prime divisors of n.A061340
a(n) = n*omega(n)^n where omega(n) is the number of distinct prime divisors of n.
- Numbers not ending in 0 whose cubes are concatenations of other cubes.A061341
Numbers not ending in 0 whose cubes are concatenations of other cubes.
- Period of the stationary component of the pattern which a row of n cells becomes in Conway's Game of Life.A061342
Period of the stationary component of the pattern which a row of n cells becomes in Conway's Game of Life.
- Number of standard shifted tableaux with n entries.A061343
Number of standard shifted tableaux with n entries.
- Numbers of form p^m + 1, p odd prime, m >= 1.A061344
Numbers of form p^m + 1, p odd prime, m >= 1.
- Powers of odd primes. Alternatively, 1 and the odd prime powers (p^k, p an odd prime, k >= 1).A061345
Powers of odd primes. Alternatively, 1 and the odd prime powers (p^k, p an odd prime, k >= 1).
- Odd numbers that are neither primes nor prime powers.A061346
Odd numbers that are neither primes nor prime powers.
- Period 3: repeat [1, 1, -2].A061347
Period 3: repeat [1, 1, -2].
- Consider a (solid) triangle with n cells on each edge, for a total of n(n+1)/2 cells; a(n) is number of inequivalent ways of labeling cells with 0's and 1's; triangle may be rotated and turned over.A061348
Consider a (solid) triangle with n cells on each edge, for a total of n(n+1)/2 cells; a(n) is number of inequivalent ways of labeling cells with 0's and 1's; triangle may be rotated and turned over.
- Sum of antidiagonals of A060736.A061349
Sum of antidiagonals of A060736.
- Maximal size of Aut(G) where G is a finite Abelian group of order n.A061350
Maximal size of Aut(G) where G is a finite Abelian group of order n.
- Between p and the next prime either there are no numbers or there is a single squarefree number.A061351
Between p and the next prime either there are no numbers or there is a single squarefree number.
- First row of array shown below.A061352
First row of array shown below.
- First column of array shown in A061352.A061353
First column of array shown in A061352.
- Numerator of Sum_{k=0..n} 1/k!.A061354
Numerator of Sum_{k=0..n} 1/k!.
- Denominator of Sum_{k=0..n} 1/k!.A061355
Denominator of Sum_{k=0..n} 1/k!.
- Triangle read by rows: T(n, k) is the number of labeled trees on n nodes with maximal node degree k (0 < k < n).A061356
Triangle read by rows: T(n, k) is the number of labeled trees on n nodes with maximal node degree k (0 < k < n).
- Number of 0<k<n such that n-k and n+k are both primes.A061357
Number of 0<k<n such that n-k and n+k are both primes.
- Number of ways of writing n = p+q with p, q primes and p >= q.A061358
Number of ways of writing n = p+q with p, q primes and p >= q.
- a(1) = 1; a(n) = least number such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.A061359
a(1) = 1; a(n) = least number such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.
- Decimal expansion of e/Pi.A061360
Decimal expansion of e/Pi.