login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088823 a(n) = GCD of the sum of largest prime factors of numbers from 1 to n and of the sum of smallest prime factors of numbers from 1 to n. 0
0, 2, 5, 7, 12, 1, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 6, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 4, 1, 3, 1, 2, 3, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 10, 1, 1, 1, 2, 29, 1, 1, 2, 1, 7, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 5, 1, 14, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

a(n)=GCD[A088821(n), A088822(n)]

CROSSREFS

Cf. A088821-A088825.

Sequence in context: A131102 A168031 A039679 * A007445 A159699 A063217

Adjacent sequences:  A088820 A088821 A088822 * A088824 A088825 A088826

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 22 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 18:41 EST 2012. Contains 206074 sequences.