Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070010
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070010 GCD of consecutive values of sum-of-proper divisors. +0
1
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; listen)
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: A103524 A110916 A164561 this_sequence A046564 A046592 A010326

Adjacent sequences: A070007 A070008 A070009 this_sequence A070011 A070012 A070013

KEYWORD

nonn

AUTHOR

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

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research