This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A276653 a(n) = floor(Sum_{p|n} 0.p) where p runs through the prime divisors of n>1. 6
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2 COMMENTS Here 0.p means the decimal fraction obtained by writing p after the decimal point, e.g., 0.11 = 11/100. See A276654(n) = the smallest number k>1 such that floor(Sum_{p|k} 0.p) = n where p runs through the prime divisors of k. LINKS Jaroslav Krizek, Table of n, a(n) for n = 2..1000 EXAMPLE For n = 35: floor(Sum_{p|35} 0.p) = floor(0.5 + 0.7) = floor(1.2) = 1. MATHEMATICA Table[Floor@ Total[# 10^(-Floor@ Log10@ # - 1) &@ FactorInteger[n][[All, 1]]], {n, 2, 120}] (* Michael De Vlieger, Sep 12 2016 *) PROG (MAGMA) [Floor(&+[d/(10^(#Intseq(d))): d in PrimeDivisors(n)]): n in [2..1000]] CROSSREFS Cf. A276513, A276651, A276652, A276654, A276655. Sequence in context: A011735 A324731 A011734 * A011733 A297045 A304570 Adjacent sequences:  A276650 A276651 A276652 * A276654 A276655 A276656 KEYWORD nonn,base AUTHOR Jaroslav Krizek, Sep 11 2016 STATUS approved

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

Last modified July 17 02:10 EDT 2019. Contains 325092 sequences. (Running on oeis4.)