23249
domain: N
Appears in sequences
- a(n) = Sum_{k=0..n} T(k) where T(n) are the tribonacci numbers A000073.at n=17A008937
- 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=14A018921
- Numbers k such that k copies of 12 followed by 1 is a palindromic prime.at n=10A056803
- Duplicate of A008937.at n=17A073769
- 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=40A118884
- 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=40A141066
- a(n) is the smallest nonnegative k such that there is no 3 X 3 matrix with entries in {1,...,n} whose determinant is k.at n=24A262719
- Number of integer partitions of n with no difference -2.at n=42A350842
- Smallest numbers k such that 2^k-1 when written in ternary contains its least significant zero in position n.at n=22A391268