102695

Appears in sequences

• Fibonacci sequence beginning 10, 9.at n=20A184959
• a(n) = Sum_{k=0..n} k*Fibonacci(2*k).at n=10A197649
• Irregular triangle read by rows: T(n,k), 2 <= n , 3 <= k <= largest k such that A067175(k) <= n , is the smallest n-digit number m such that omega(m) = A001221(m) = k, and its largest prime factor equals the sum of its remaining prime factors. or -1 if no such number exists.at n=11A383677