@article{Phunphayap2022, 
author = {Phakhinkon Napp Phunphayap and Prapanpong Pongsriiam},
title = {Divisibility of Fibonomial coefficients in terms of their digital representations and applications},
year = {2022},
journal = {AIMS Mathematics},
volume = {7},
number = {4},
pages = {5314-5327},
keywords = {Fibonomial coefficient, Fibonacci number, digit, sum of digits function, divisibility, asymptotic, binomial coefficient},
url = {https://www.sciopen.com/article/10.3934/math.2022296},
doi = {10.3934/math.2022296},
abstract = {We give a characterization for the integers    n  ≥  1 such that the Fibonomial coefficient                                (                                      p            n                    n                          )                      F   is divisible by    p for any prime    p  ≠  2  ,  5. Then we use it to calculate asymptotic formulas for the number of positive integers    n  ≤  x such that    p  ∣                              (                                      p            n                    n                          )                      F  . This completes the study on this problem for all primes    p.}
}