login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A229298
Number of terms in A228919 less than or equal to 10^n.
2
5, 54, 515, 5109, 50933, 508932, 5087994
OFFSET
1,1
COMMENTS
0.50801 < lim A229298(n)/10^n = lim A229299(n)/10^n < 0.50966.
Compare with A229299(n)/10^n.
LINKS
J. M. Grau, A. M. Oller-Marcén, About the congruence sum_{k=1..n} k^{f(n)} == 0 (mod n), arXiv:1304.2678 [math.NT], 2013.
MATHEMATICA
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}]
CROSSREFS
KEYWORD
nonn,more,hard
AUTHOR
STATUS
approved