|
%I #13 Jan 06 2022 08:17:40
%S 0,1,2,3,1,1,3,3,5,0,1,1,1,3,5,4,3,7,7,1,1,3,3,5,6,5,4,7,10,2,3,1,5,6,
%T 5,7,7,9,11,1,4,1,2,1,8,9,2,7,6,4,5,1,1,8,7,10,5,11,11,5,3,5,1,1,5,5,
%U 6,1,2,6,1,8,7,10
%N a(n) = prime(n) mod (sum of base-10 digits of n) where prime(n) is the n-th prime.
%o (PARI) a(n) = prime(n) % sumdigits(n); \\ _Michel Marcus_, Jan 05 2022
%Y Cf. A000040, A007953.
%K nonn,base,less
%O 1,3
%A _Juri-Stepan Gerasimov_, Aug 04 2008
%E Corrected and edited by _D. S. McNeil_, Mar 21 2009
|
