Standard Nim
C_K_Yang ironman353 czp001 abcwuhang liuguangxi zimpha a_forsteri Min_25 Philippe_57721 gerrob benito255
Public  06/24/17  8xp  Math  55.0% 
Let $C(n, k)$ be the number of integer solutions $(x_1, \ldots, x_k)$ such that $\bigoplus_{i=1}^k x_i = 0$ and $0 \le x_i < n$ for each $i$. Here, $x \oplus y$ means $x$ xor $y$.
Let $F(n)$ be the $n$th fibonacci number: $F(0) = 0, F(1) = 1$, and $F(i) = F(i  1) + F(i  2)$ for $i \ge 2$.
Let $$ S(n) := \sum_{i=1}^{n} \sum_{j=1}^{n} C(F(i), F(j)). $$ You are given $S(6) = 2153296$ and $S(7) = 18998620089329$.
Find $S(92)$ modulo $10^9 + 7$.
[My timing] 0.3 seconds.
New Members
 nebula001 2d:21h
 PeterisP 1w
 Arun_CoDeR 1w
 hankim 2w:3d
 chfmoe 3w
Fresh Problems

Kimberling Sequence 1d:2h
solved by 6 
Palindromic Infinite Sequence 1w:1d
solved by 3 
Convergents of infinite sum 1w:5d
solved by 5 
Permutation Order II 2w:1d
solved by 8 
Integral circle packings 2 2w:4d
solved by 3