Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097974
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097974 Sum of distinct prime divisors of n which are <= sqrt(n). +0
4
0, 0, 0, 2, 0, 2, 0, 2, 3, 2, 0, 5, 0, 2, 3, 2, 0, 5, 0, 2, 3, 2, 0, 5, 5, 2, 3, 2, 0, 10, 0, 2, 3, 2, 5, 5, 0, 2, 3, 7, 0, 5, 0, 2, 8, 2, 0, 5, 7, 7, 3, 2, 0, 5, 5, 9, 3, 2, 0, 10, 0, 2, 10, 2, 5, 5, 0, 2, 3, 14, 0, 5, 0, 2, 8, 2, 7, 5, 0, 7, 3, 2, 0, 12, 5, 2, 3, 2, 0, 10, 7, 2, 3, 2, 5, 5, 0, 9, 3, 7, 0, 5, 0 (list; graph; listen)
OFFSET

1,4

EXAMPLE

2 and 3 are the distinct prime divisors of 12, and both 2 and 3 are <= squareroot of 12. So a(12) = 2 + 3 = 5.

MAPLE

with(numtheory): a:=proc(n) local s, F, f, i: s:=0: F:=factorset(n): f:=nops(F): for i from 1 to f do if F[i]^2<=n then s:=s+F[i] else s:=s: fi od: s; end: seq(a(n), n=1..110); (Deutsch) (Deutsch)

MATHEMATICA

Do[Print[Plus @@ Select[Select[Divisors[n], PrimeQ], #<=Sqrt[n] &]], {n, 1, 100}] (Propper)

CROSSREFS

Adjacent sequences: A097971 A097972 A097973 this_sequence A097975 A097976 A097977

Sequence in context: A140302 A085341 A063918 this_sequence A139036 A090330 A132747

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Sep 07 2004

EXTENSIONS

More terms from Ryan Propper (rpropper(AT)stanford.edu), Jul 23 2005

Further terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jan 30 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research