OFFSET
0,7
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 0..1000
P. Erdős, On some problems in graph theory, combinatorial analysis and combinatorial number theory, Graph Theory and Combinatorics, Proc. Conf. Hon. P. Erdos, Cambridge 1983, 1-17 (1984).
Andrzej Grzesik, On the maximum number of C5's in a triangle-free graph, arXiv:1102.0962 [math.CO], 2011-2012.
E. Győri, On the number of C5s in a triangle-free graph, Combinatorica 9(1) (1989) 101-102.
H. Hatami, J. Hladky, D. Král, S. Norine, and A. Razborov, On the Number of Pentagons in Triangle-Free Graphs, arXiv:1102.1634 [math.CO], 2011-2012.
FORMULA
a(n) = floor((n/5)^5).
EXAMPLE
a(23) = floor((23/5)^5) = floor(2059.62976) = 2059.
PROG
(PARI) a(n)=n^5 \ 3125 \\ Charles R Greathouse IV, Oct 17 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jonathan Vos Post, Feb 10 2011
STATUS
approved