45067

Appears in sequences

• Define the 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) for n >= 0. This is T(3,7).at n=12A019489
• Define the 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) for n >= 0. This is T(16,36).at n=10A022040
• a(n) = T(n,n-3), where T is the array in A026374.at n=42A026382
• a(n) = T(n,n-3), where T is the array in A026386.at n=42A026394
• a(1)=1, a(2)=2, a(3)=3; for n >= 3, a(n) is smallest number such that all a(i) for 1 <= i <= n are distinct, all a(i)+a(j) for 1 <= i < j <= n are distinct and all a(i)+a(j)+a(k) for 1 <= i < j < k <= n are distinct.at n=29A036241
• Expansion of (1-x)^(-1)/(1-2*x-x^3).at n=13A077852
• a(n) is the smallest k such that (Z/kZ)* contains C_(2n) X C_(2n) as a subgroup, where (Z/kZ)* is the multiplicative group of integers modulo n.at n=39A307436