Sequences
392,541 sequences
- Essentially A053506 but with leading 0 (instead of 1) and offset 0.A055861
Essentially A053506 but with leading 0 (instead of 1) and offset 0.
- Fourth column of triangle A055858.A055862
Fourth column of triangle A055858.
- Fifth column of triangle A055858.A055863
Fifth column of triangle A055858.
- Coefficient triangle for certain polynomials.A055864
Coefficient triangle for certain polynomials.
- Second column of triangle A055864.A055865
Second column of triangle A055864.
- Largest number that has the same number of digits in base 10 and base n, or 0 if no such number exists.A055866
Largest number that has the same number of digits in base 10 and base n, or 0 if no such number exists.
- Fourth column of triangle A055864.A055867
Fourth column of triangle A055864.
- Fifth column of triangle A055864.A055868
Fifth column of triangle A055864.
- a(n) = (n+1)^n - n^n.A055869
a(n) = (n+1)^n - n^n.
- Signed Fibonomial triangle.A055870
Signed Fibonomial triangle.
- Row sums of signed Fibonomial triangle A055870.A055871
Row sums of signed Fibonomial triangle A055870.
- a(n) and floor(a(n)/8) are both squares; i.e., squares that remain squares when written in base 8 and last digit is removed.A055872
a(n) and floor(a(n)/8) are both squares; i.e., squares that remain squares when written in base 8 and last digit is removed.
- a(0) = 1; a(n) = sum_{k=1 to d(n)} [a(n-k)] where d(n) is number of positive divisors of n.A055873
a(0) = 1; a(n) = sum_{k=1 to d(n)} [a(n-k)] where d(n) is number of positive divisors of n.
- a(n) = largest m such that 1, 2, ..., m divide n.A055874
a(n) = largest m such that 1, 2, ..., m divide n.
- a(0)=1, a(n) = prime(n^3).A055875
a(0)=1, a(n) = prime(n^3).
- a(n) = round( 1 + e^(n-2) ).A055876
a(n) = round( 1 + e^(n-2) ).
- Least increasing sequence with a(1) = 1 and Hankel transform {1,1,1,1,...}.A055877
Least increasing sequence with a(1) = 1 and Hankel transform {1,1,1,1,...}.
- Least positive sequence with Hankel transform {1,1,1,1,1,...}.A055878
Least positive sequence with Hankel transform {1,1,1,1,1,...}.
- Least nondecreasing sequence with a(1) = 1 and Hankel transform {1,1,1,1,...}.A055879
Least nondecreasing sequence with a(1) = 1 and Hankel transform {1,1,1,1,...}.
- Quotients arising from sequence A053317.A055880
Quotients arising from sequence A053317.
- a(n) = largest m such that m! divides n.A055881
a(n) = largest m such that m! divides n.
- a(n) = 2^n*Bell(n). E.g.f.: exp(exp(2*x)-1).A055882
a(n) = 2^n*Bell(n). E.g.f.: exp(exp(2*x)-1).
- Exponential transform of Pascal's triangle A007318.A055883
Exponential transform of Pascal's triangle A007318.
- Euler transform of partition triangle A008284.A055884
Euler transform of partition triangle A008284.
- Euler transform applied twice to partition triangle A008284.A055885
Euler transform applied twice to partition triangle A008284.
- Euler transform applied three times to partition triangle A008284.A055886
Euler transform applied three times to partition triangle A008284.
- Number of ordered partitions of partitions.A055887
Number of ordered partitions of partitions.
- Invert transform of partition triangle A008284.A055888
Invert transform of partition triangle A008284.
- CIK transform of partition triangle A008284.A055889
CIK transform of partition triangle A008284.
- CIK transform of partition numbers A000041.A055890
CIK transform of partition numbers A000041.
- CIK (necklace, indistinct, unlabeled) transform of powers of 2.A055891
CIK (necklace, indistinct, unlabeled) transform of powers of 2.
- Also aperiodic partitions of n into k parts.A055892
Also aperiodic partitions of n into k parts.
- Inverse Moebius transform of partition triangle A008284.A055893
Inverse Moebius transform of partition triangle A008284.
- Inverse Moebius transform of Pascal's triangle A007318.A055894
Inverse Moebius transform of Pascal's triangle A007318.
- Inverse Moebius transform of powers of 2.A055895
Inverse Moebius transform of powers of 2.
- Exponential transform of Stirling2 triangle A008277.A055896
Exponential transform of Stirling2 triangle A008277.
- a(n) = n*(n-1)^(n-1).A055897
a(n) = n*(n-1)^(n-1).
- Triangle: Number of directed site animals on a square lattice with n+1 total sites and k sites supported in one particular way.A055898
Triangle: Number of directed site animals on a square lattice with n+1 total sites and k sites supported in one particular way.
- Column 3 of triangle A055898.A055899
Column 3 of triangle A055898.
- Column 4 of triangle A055898.A055900
Column 4 of triangle A055898.
- Column 5 of triangle A055898.A055901
Column 5 of triangle A055898.
- Column 6 of triangle A055898.A055902
Column 6 of triangle A055898.
- Column 7 of triangle A055898.A055903
Column 7 of triangle A055898.
- Column 8 of triangle A055898.A055904
Column 8 of triangle A055898.
- Matrix inverse of triangle A055898.A055905
Matrix inverse of triangle A055898.
- Column 0 of triangle A055905.A055906
Column 0 of triangle A055905.
- Triangle: number of directed site animals on hexagonal net (honeycomb) with n total sites and k sites supported in one particular way.A055907
Triangle: number of directed site animals on hexagonal net (honeycomb) with n total sites and k sites supported in one particular way.
- Column 2 of triangle A055907.A055908
Column 2 of triangle A055907.
- Column 3 of triangle A055907.A055909
Column 3 of triangle A055907.
- Column 4 of triangle A055907.A055910
Column 4 of triangle A055907.