42762
domain: N
Appears in sequences
- a(n) = Sum_{k=0..n} T(k) where T(n) are the tribonacci numbers A000073.at n=18A008937
- Define the generalized Pisot sequence T(a(0),a(1)) by: a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n). This is T(4,8).at n=15A018921
- [ exp(1/17)*n! ].at n=7A030899
- Sum of a(n) terms of 1/k^(8/9) first exceeds n.at n=21A056185
- Numbers n such that 2*10^n - 7 is prime.at n=17A102946
- Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 0011 (n,k>=0).at n=45A118884
- Let M(n) = maximal value of (n/k)^k over all k = 1, 2, ...; a(n) = floor(M(n)).at n=28A139076
- Let M(n) = maximal value of (n/k)^k over all k = 1, 2, ...; a(n) = round(M(n)).at n=28A139077
- List of different composites in Pascal-like triangles with index of asymmetry y = 2 and index of obliquity z = 0 or z = 1.at n=43A141066
- Main diagonal of A332359.at n=19A332360
- Number of quadrilateral regions in an equilateral triangular "frame" of size n (see Comments in A328526 for definition).at n=19A333033
- Expansion of Sum_{k>0} x^(2*k)/(1-x^k)^6.at n=20A363606