Sequences
392,541 sequences
- Sums of two powers of 16.A055261
Sums of two powers of 16.
- n + sum of digits of a(n-1).A055262
n + sum of digits of a(n-1).
- a(n) = Sum of digits of (n + a(n-1)).A055263
a(n) = Sum of digits of (n + a(n-1)).
- Possible values of A055263; numbers equal to 0, 1, 3 or 6 modulo 9.A055264
Possible values of A055263; numbers equal to 0, 1, 3 or 6 modulo 9.
- a(n) is the smallest positive integer not already in the sequence such that a(n)+a(n-1) is prime, starting with a(1)=1.A055265
a(n) is the smallest positive integer not already in the sequence such that a(n)+a(n-1) is prime, starting with a(1)=1.
- a(n) + a(n+1) is never prime; lexicographically earliest such sequence of distinct positive integers.A055266
a(n) + a(n+1) is never prime; lexicographically earliest such sequence of distinct positive integers.
- a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=7.A055267
a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=7.
- a(n) = (11*n + 4)*C(n+3, 3)/4.A055268
a(n) = (11*n + 4)*C(n+3, 3)/4.
- a(n) = 4*a(n-1) - a(n-2) + 3 with a(0)=1, a(1)=7.A055269
a(n) = 4*a(n-1) - a(n-2) + 3 with a(0)=1, a(1)=7.
- a(n) = 7*a(n-1) + (-1)^n * binomial(2,2-n) with a(-1)=0.A055270
a(n) = 7*a(n-1) + (-1)^n * binomial(2,2-n) with a(-1)=0.
- a(n) = 5*a(n-1) - a(n-2) with a(0)=1, a(1)=7.A055271
a(n) = 5*a(n-1) - a(n-2) with a(0)=1, a(1)=7.
- First differences of 7^n (A000420).A055272
First differences of 7^n (A000420).
- a(n) = 3*a(n-1) - a(n-2) with a(0) = 1, a(1) = 8.A055273
a(n) = 3*a(n-1) - a(n-2) with a(0) = 1, a(1) = 8.
- First differences of 8^n (A001018).A055274
First differences of 8^n (A001018).
- First differences of 9^n (A001019).A055275
First differences of 9^n (A001019).
- First differences of 11^n (A001020).A055276
First differences of 11^n (A001020).
- Triangle T(n,k) of number of rooted trees with n nodes and k leaves, 1 <= k <= n.A055277
Triangle T(n,k) of number of rooted trees with n nodes and k leaves, 1 <= k <= n.
- Number of rooted trees with n nodes and 3 leaves.A055278
Number of rooted trees with n nodes and 3 leaves.
- Number of rooted trees with n nodes and 4 leaves.A055279
Number of rooted trees with n nodes and 4 leaves.
- Number of rooted trees with n nodes and 5 leaves.A055280
Number of rooted trees with n nodes and 5 leaves.
- Number of rooted trees with n nodes and 6 leaves.A055281
Number of rooted trees with n nodes and 6 leaves.
- Number of rooted trees with n nodes and 7 leaves.A055282
Number of rooted trees with n nodes and 7 leaves.
- Number of rooted trees with n nodes and 8 leaves.A055283
Number of rooted trees with n nodes and 8 leaves.
- Number of rooted trees with n nodes and 9 leaves.A055284
Number of rooted trees with n nodes and 9 leaves.
- Number of rooted trees with n nodes and 10 leaves.A055285
Number of rooted trees with n nodes and 10 leaves.
- Number of rooted trees with n nodes and 11 leaves.A055286
Number of rooted trees with n nodes and 11 leaves.
- Number of rooted trees with n nodes and 12 leaves.A055287
Number of rooted trees with n nodes and 12 leaves.
- Matrix inverse of triangle A055277(n+1,k).A055288
Matrix inverse of triangle A055277(n+1,k).
- Column 1 of triangle A055288.A055289
Column 1 of triangle A055288.
- Triangle of trees with n nodes and k leaves, 2 <= k <= n.A055290
Triangle of trees with n nodes and k leaves, 2 <= k <= n.
- Number of trees with n nodes and 4 leaves.A055291
Number of trees with n nodes and 4 leaves.
- Number of trees with n nodes and 5 leaves.A055292
Number of trees with n nodes and 5 leaves.
- Number of trees with n nodes and 6 leaves.A055293
Number of trees with n nodes and 6 leaves.
- Number of trees with n nodes and 7 leaves.A055294
Number of trees with n nodes and 7 leaves.
- Number of trees with n nodes and 8 leaves.A055295
Number of trees with n nodes and 8 leaves.
- Number of trees with n nodes and 9 leaves.A055296
Number of trees with n nodes and 9 leaves.
- Number of trees with n nodes and 10 leaves.A055297
Number of trees with n nodes and 10 leaves.
- Number of trees with n nodes and 11 leaves.A055298
Number of trees with n nodes and 11 leaves.
- Number of trees with n nodes and 12 leaves.A055299
Number of trees with n nodes and 12 leaves.
- Matrix inverse of triangle A055290(n+1,k).A055300
Matrix inverse of triangle A055290(n+1,k).
- Column 2 of triangle A055300.A055301
Column 2 of triangle A055300.
- Triangle of number of labeled rooted trees with n nodes and k leaves, n >= 1, 1 <= k <= n.A055302
Triangle of number of labeled rooted trees with n nodes and k leaves, n >= 1, 1 <= k <= n.
- Number of labeled rooted trees with n nodes and 2 leaves.A055303
Number of labeled rooted trees with n nodes and 2 leaves.
- Number of labeled rooted trees with n nodes and 3 leaves.A055304
Number of labeled rooted trees with n nodes and 3 leaves.
- Number of labeled rooted trees with n nodes and 4 leaves.A055305
Number of labeled rooted trees with n nodes and 4 leaves.
- Number of labeled rooted trees with n nodes and 5 leaves.A055306
Number of labeled rooted trees with n nodes and 5 leaves.
- Number of labeled rooted trees with n nodes and 6 leaves.A055307
Number of labeled rooted trees with n nodes and 6 leaves.
- Number of labeled rooted trees with n nodes and 7 leaves.A055308
Number of labeled rooted trees with n nodes and 7 leaves.
- Number of labeled rooted trees with n nodes and 8 leaves.A055309
Number of labeled rooted trees with n nodes and 8 leaves.
- Number of labeled rooted trees with n nodes and 9 leaves.A055310
Number of labeled rooted trees with n nodes and 9 leaves.