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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070010 GCD of consecutive values of sum-of-proper divisors. 0
1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 11, 1, 1, 1, 6, 2, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 1, 1, 1, 23, 1, 1, 1, 1, 3, 1, 1, 5, 25, 1, 1, 1, 1, 3, 1, 1, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,9

FORMULA

a(n)=GCD[DivisorSigma[1, n+1]-(n+1), DivisorSigma[1, n]-n]= GCD[A001065(n+1), A001065(n)].

CROSSREFS

Cf. A000203, A001065; GCD of various consecutive function values: A048586, A057467, A058515, A060778, A060780, A069896.

Sequence in context: A184101 A164561 A178764 * A046564 A046592 A010326

Adjacent sequences:  A070007 A070008 A070009 * A070011 A070012 A070013

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 11 2002

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 15 23:53 EST 2012. Contains 205860 sequences.