Sequences

392,541 sequences

Number of partitions of n in which the greatest part is 5.A026811
Number of partitions of n in which the greatest part is 5.
Number of partitions of n in which the greatest part is 6.A026812
Number of partitions of n in which the greatest part is 6.
Number of partitions of n in which the greatest part is 7.A026813
Number of partitions of n in which the greatest part is 7.
Number of partitions of n in which the greatest part is 8.A026814
Number of partitions of n in which the greatest part is 8.
Number of partitions of n in which the greatest part is 9.A026815
Number of partitions of n in which the greatest part is 9.
Number of partitions of n in which the greatest part is 10.A026816
Number of partitions of n in which the greatest part is 10.
Duplicate of A022269.A026817
Duplicate of A022269.
Largest digit of n concatenated with smallest digit of n is prime.A026818
Largest digit of n concatenated with smallest digit of n is prime.
a(n) = least k such that if 1<=h<=n then T(n,k)>=T(n,h), T given by A008284.A026819
a(n) = least k such that if 1<=h<=n then T(n,k)>=T(n,h), T given by A008284.
Euler's table: triangular array T read by rows, where T(n,k) = number of partitions in which every part is <= k for 1 <= k <= n. Also number of partitions of n into at most k parts.A026820
Euler's table: triangular array T read by rows, where T(n,k) = number of partitions in which every part is <= k for 1 <= k <= n. Also number of partitions of n into at most k parts.
Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts, the least being k, for k=1,2,...,n.A026821
Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts, the least being k, for k=1,2,...,n.
CONTINUANT transform of Fibonacci number 1, 1, 2, 3, 5, 8, ...A026822
CONTINUANT transform of Fibonacci number 1, 1, 2, 3, 5, 8, ...
Essentially same as A025148.A026823
Essentially same as A025148.
Number of partitions of n into distinct parts, the least being 3.A026824
Number of partitions of n into distinct parts, the least being 3.
Number of partitions of n into distinct parts, the least being 4.A026825
Number of partitions of n into distinct parts, the least being 4.
Number of partitions of n into distinct parts, the least being 5.A026826
Number of partitions of n into distinct parts, the least being 5.
Number of partitions of n into distinct parts, the least being 6.A026827
Number of partitions of n into distinct parts, the least being 6.
Number of partitions of n into distinct parts, the least being 7.A026828
Number of partitions of n into distinct parts, the least being 7.
Number of partitions of n into distinct parts, the least being 8.A026829
Number of partitions of n into distinct parts, the least being 8.
Number of partitions of n into distinct parts, the least being 9.A026830
Number of partitions of n into distinct parts, the least being 9.
Number of partitions of n into distinct parts, the least being 10.A026831
Number of partitions of n into distinct parts, the least being 10.
Number of partitions of n into distinct parts, the least being odd.A026832
Number of partitions of n into distinct parts, the least being odd.
Number of partitions of n into distinct parts, the least being even.A026833
Number of partitions of n into distinct parts, the least being even.
a(n) = number of numbers k such that only one partition of n into distinct parts has least part k.A026834
a(n) = number of numbers k such that only one partition of n into distinct parts has least part k.
Triangular array read by rows: T(n,k) = number of partitions of n into distinct parts in which every part is >=k, for k=1,2,...,n.A026835
Triangular array read by rows: T(n,k) = number of partitions of n into distinct parts in which every part is >=k, for k=1,2,...,n.
Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts, the greatest being k, for k=1,2,...,n.A026836
Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts, the greatest being k, for k=1,2,...,n.
Number of partitions of n into distinct parts, the greatest being odd.A026837
Number of partitions of n into distinct parts, the greatest being odd.
Number of partitions of n into distinct parts, the greatest being even.A026838
Number of partitions of n into distinct parts, the greatest being even.
a(n) = MAX{T(n,k) for k=1,2,...,n}, T given in A026836.A026839
a(n) = MAX{T(n,k) for k=1,2,...,n}, T given in A026836.
Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts <= k, for k=1,2,...n.A026840
Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts <= k, for k=1,2,...n.
a(n) = T(2n,n-4), T given by A026725.A026841
a(n) = T(2n,n-4), T given by A026725.
a(n) = T(2n,n-3), T given by A026725.A026842
a(n) = T(2n,n-3), T given by A026725.
a(n) = T(2n,n+3), T given by A026725.A026843
a(n) = T(2n,n+3), T given by A026725.
a(n) = T(2n,n+4), T given by A026725.A026844
a(n) = T(2n,n+4), T given by A026725.
Sum_{mu a partition of n} (f^mu/n!)^{-2} where f^mu is the number of standard Young tableaux of shape mu.A026845
Sum_{mu a partition of n} (f^mu/n!)^{-2} where f^mu is the number of standard Young tableaux of shape mu.
a(n) = T(2n+1,n+4), T given by A026725.A026846
a(n) = T(2n+1,n+4), T given by A026725.
a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), where m=[ (n+1)/2 ], T given by A026725.A026847
a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), where m=[ (n+1)/2 ], T given by A026725.
a(n) = T(2n,n-4), T given by A026736.A026848
a(n) = T(2n,n-4), T given by A026736.
a(n) = T(2n,n-3), T given by A026736.A026849
a(n) = T(2n,n-3), T given by A026736.
a(n) = T(2n,n+1), T given by A026736.A026850
a(n) = T(2n,n+1), T given by A026736.
a(n) = T(2n,n+2), T given by A026736.A026851
a(n) = T(2n,n+2), T given by A026736.
a(n) = T(2n,n+3), T given by A026736.A026852
a(n) = T(2n,n+3), T given by A026736.
a(n) = T(2n,n+4), T given by A026736.A026853
a(n) = T(2n,n+4), T given by A026736.
a(n) = T(2n+1,n+1), T given by A026736.A026854
a(n) = T(2n+1,n+1), T given by A026736.
a(n) = T(2n+1,n+2), T given by A026736.A026855
a(n) = T(2n+1,n+2), T given by A026736.
a(n) = T(2n+1,n+3), T given by A026736.A026856
a(n) = T(2n+1,n+3), T given by A026736.
a(n) = T(2n+1,n+4), T given by A026736.A026857
a(n) = T(2n+1,n+4), T given by A026736.
Number of letters in n (in Italian).A026858
Number of letters in n (in Italian).
T(2n,n-4), T given by A026747.A026859
T(2n,n-4), T given by A026747.
T(2n,n-3), T given by A026747.A026860
T(2n,n-3), T given by A026747.