46368

Appears in sequences

• F(2n) = bisection of Fibonacci sequence: a(n) = 3*a(n-1) - a(n-2).at n=12A001906
• a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.at n=24A005013
• Coefficients of the '2nd-order' mock theta function A(q).at n=44A006304
• Theta series of {D_8}* lattice.at n=10A008427
• Expansion of e.g.f.: sec(arctanh(x)*log(x+1))=1+12/4!*x^4-60/5!*x^5+570/6!*x^6-3780/7!*x^7...at n=8A012707
• Even Fibonacci numbers; or, Fibonacci(3*n).at n=8A014445
• a(n) = lcm(n, Fibonacci(n)).at n=23A014965
• Pisot sequence E(2,3).at n=21A020695
• Pisot sequences E(3,5), P(3,5).at n=20A020701
• Pisot sequences E(5,8), P(5,8).at n=19A020712
• a(n) = floor( n(n+1)(n+2)(n+3)(n+4) / (n+(n+1)+(n+2)+(n+3)+(n+4)) ).at n=20A032768
• Integer quotients of n(n + 1)(n + 2)(n + 3)(n + 4) / (n+(n+1)+(n+2)+(n+3)+(n+4)).at n=16A032770
• a(n) = Fibonacci(4*n).at n=6A033888
• Products of successive Fibonacci numbers.at n=43A034722
• Values of k for which there are no empty intervals when fractional part(m*phi) for m = 1, ..., k is plotted along [ 0, 1 ] subdivided into k equal regions.at n=26A036415
• Fibonacci numbers having initial digit '4'.at n=1A045728
• Smallest positive Fibonacci number divisible by n.at n=27A047930
• Smallest positive Fibonacci number divisible by n.at n=22A047930
• Smallest positive Fibonacci number divisible by n.at n=13A047930
• Smallest positive Fibonacci number divisible by n.at n=31A047930