login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247193 a(n) = gcd(n!, Fibonacci(n)). 1
1, 1, 2, 3, 5, 8, 1, 21, 2, 5, 1, 144, 1, 13, 10, 21, 1, 136, 1, 165, 26, 1, 1, 46368, 25, 1, 34, 39, 1, 440, 1, 21, 2, 1, 65, 139536, 1, 37, 2, 1155, 1, 3016, 1, 129, 170, 1, 1, 4358592, 13, 275, 2, 3, 1, 136952, 5, 55419, 74, 1, 1, 10066320, 1, 1, 442, 987, 5, 8, 1, 201, 2, 20735, 1, 44930592, 1, 73, 3050, 111, 13, 8, 1, 2225685 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = gcd(n!, Fibonacci(n)).
a(A069180(n)) == 1. - Michel Marcus, Nov 25 2014
EXAMPLE
For n = 8: GCD(8!, Fibonacci(8)) = 21.
MAPLE
seq(igcd(n!, combinat:-fibonacci(n)), n=1..100); # Robert Israel, Nov 24 2014
MATHEMATICA
a[n_] := GCD[n!, Fibonacci[n]];
Table[a[n], {n, 1, 300}]
PROG
(PARI) vector(100, n, gcd(n!, fibonacci(n))) \\ Derek Orr, Nov 24 2014
CROSSREFS
Sequence in context: A089911 A098978 A111301 * A362358 A096320 A105955
KEYWORD
nonn,easy
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)