login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075765 a(n) = floor(prime(n)/n) + (prime(n) mod n). 0
2, 2, 3, 4, 3, 3, 5, 5, 7, 11, 11, 4, 5, 4, 5, 8, 11, 10, 13, 14, 13, 16, 17, 20, 25, 26, 25, 26, 25, 26, 7, 7, 9, 7, 13, 11, 13, 15, 15, 17, 19, 17, 23, 21, 21, 19, 27, 35, 35, 33, 33, 35, 33, 39, 41, 43, 45, 43, 45, 45, 43, 49, 59, 59, 57, 57, 67, 69, 7, 73, 73, 75, 7, 8, 9, 8, 9, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The digital sum base n of the n-th prime. - Hieronymus Fischer, Dec 24 2007
LINKS
FORMULA
p(n)/n = k + r; r<n; a(n) = k + r; p prime, n, k, r integers.
a(n) = ds_n(prime(n)), where ds_n = digital sum base n. - Hieronymus Fischer, Oct 09 2007
a(n) = prime(n) - (n-1)*sum_{k>0} floor(prime(n)/n^k) = prime(n) - (n-1)*floor(prime(n)/n). - Hieronymus Fischer, Oct 09 2007
EXAMPLE
p(9)/9=23/9=2+5/9; a(9)=2+5=7
MATHEMATICA
fmQ[n_]:=Module[{pn=Prime[n]}, Floor[pn/n]+Mod[pn, n]]
fmQ/@Range[90] (* Harvey P. Dale, Feb 25 2011 *)
CROSSREFS
Cf. A007953.
Sequence in context: A054703 A048206 A290740 * A309899 A181024 A214744
KEYWORD
nonn
AUTHOR
Werner D. Sand, Oct 09 2002
EXTENSIONS
Corrected by Hieronymus Fischer, Oct 09 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 29 23:09 EST 2024. Contains 370428 sequences. (Running on oeis4.)