39604

Appears in sequences

• a(n) = a(n-1) + a(n-2) - 1 for n > 1, a(0)=3, a(1)=2.at n=22A001612
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Lucas numbers), t = A023533.at n=55A024476
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = A000032, t = A023533.at n=54A025096
• Number of 3-covers of an unlabeled n-set.at n=18A055195
• a(n) = Lucas(2*n) + 1.at n=11A065034
• a(n) = Lucas(n) + (-1)^n.at n=22A099925
• Numbers having three 1's in their base-phi representation.at n=12A104626
• Duplicate of A065034.at n=11A107328
• a(n) = L(3*n)/L(n), where L(n) = Lucas number.at n=11A110391
• Numbers k which when sandwiched between two 4's give a multiple of k.at n=20A116439
• Numbers k which when sandwiched between two 8's give a multiple of k.at n=24A116443
• Number of n-digit numbers m such that m and m^10 are zeroless.at n=8A124650
• a(0)=1; for n >= 1, a(n) = ceiling(Fibonacci(n)/a(n-1)).at n=46A140829
• Number of length n 1..(5+2) arrays with no leading partial sum equal to a prime and no consecutive values equal.at n=7A255713
• List of numbers L and L + 1, where L = A000032, the Lucas numbers, sorted into increasing order and duplicates removed.at n=42A259626
• Number of maximal independent vertex sets (and minimal vertex covers) in the n-Moebius ladder graph.at n=19A290608
• Number of odd chordless cycles in the 2n-Moebius ladder graph.at n=11A301773
• Intersection of A361073 and 2 * A361611.at n=40A361215
• Number of distinct non-subset-sums of integer partitions of n.at n=34A365918