This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A229299 #24 Mar 25 2015 01:56:26
%S A229299 3,30,347,3872,41311,430305,4423115
%N A229299 Number of terms in A191677 less than or equal to 10^n.
%C A229299 0.50801 < lim A229299(n)/10^n = lim A229298(n)/10^n < 0.50966.
%C A229299 It seems that the convergence of A(n)/10^n is very slow; compare with A229298(n)/10^n.
%H A229299 J. M. Grau, A. M. Oller-Marcén, <a href="http://arxiv.org/abs/1304.2678">About the congruence sum_{k=1}^n k^f(n) == 0 (mod n)</a>, arXiv:1304.2678 [math.NT], 2013.
%t A229299 fa=FactorInteger;Carlitz[k_,n_] := Mod[n-Sum[If[IntegerQ[k/(fa[n][[i,1]]-1)], n/fa[n][[i, 1]], 0], {i, 1, Length[fa[n]]}], n];supercar[k_, n_] := If[k == 1 || Mod[k,2] == 0 || Mod[n, 4] > 0, Carlitz[k, n], Mod[Carlitz[k, n] - n/2, n]]; Table[Print[Length@Select[Range[10^n], supercar[#-1,#] == 0 &]],{n, 1, 7}]
%Y A229299 Cf. A228919, A229298, A191677.
%K A229299 nonn,more,hard
%O A229299 1,1
%A A229299 _José María Grau Ribas_, Sep 20 2013