login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061496 a(n) = gcd(abundant(n), abundant(n+1)) where abundant(n) is the n-th abundant number. 1
6, 2, 4, 6, 6, 4, 2, 6, 6, 2, 4, 6, 2, 2, 6, 2, 4, 4, 2, 6, 4, 2, 2, 4, 4, 2, 6, 6, 6, 6, 2, 4, 6, 6, 4, 2, 6, 6, 2, 4, 6, 6, 4, 2, 2, 4, 4, 2, 6, 4, 2, 2, 4, 6, 6, 6, 6, 6, 2, 4, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

FORMULA

a(n) = gcd(A005101(n), A005101(n+1)).

EXAMPLE

a(1) = gcd(12, 18) = 6.

PROG

(PARI) { x=12; for (n=1, 1000, y=x+1; until (sigma(y) > 2*y, y++); write("b061496.txt", n, " ", gcd(x, y)); x=y ) } \\ Harry J. Smith, Jul 23 2009

CROSSREFS

Cf. A005101.

Sequence in context: A084945 A010493 A175286 * A125115 A202244 A257535

Adjacent sequences:  A061493 A061494 A061495 * A061497 A061498 A061499

KEYWORD

nonn

AUTHOR

Jason Earls, Jun 12 2001

EXTENSIONS

Corrected and extended by Jason G. Wurtzel, Nov 21 2006

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 27 03:08 EDT 2020. Contains 337380 sequences. (Running on oeis4.)