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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060780 GCD[sigma(n+1), sigma(n)] = GCD[A000203(n+1), A000203(n)]. 7
1, 1, 1, 1, 6, 4, 1, 1, 1, 6, 4, 14, 2, 24, 1, 1, 3, 1, 2, 2, 4, 12, 12, 1, 1, 2, 8, 2, 6, 8, 1, 3, 6, 6, 1, 1, 2, 4, 2, 6, 6, 4, 4, 6, 6, 24, 4, 1, 3, 3, 2, 2, 6, 24, 24, 40, 10, 30, 12, 2, 2, 8, 1, 1, 12, 4, 2, 6, 48, 72, 3, 1, 2, 2, 4, 4, 24, 8, 2, 1, 1, 42, 28, 4, 12, 12, 60, 90, 18, 2, 56, 8 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

LINKS

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

PROG

(PARI) { t=1; for (n=1, 1000, s=sigma(n+1); write("b060780.txt", n, " ", gcd(s, t)); t=s; ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 11 2009]

CROSSREFS

A000203.

Sequence in context: A166978 A158567 A021160 * A199391 A106333 A104748

Adjacent sequences:  A060777 A060778 A060779 * A060781 A060782 A060783

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 26 2001

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 08:40 EST 2012. Contains 205998 sequences.