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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062321 a(1) = 1; a(n) = gcd {n*(n+1), a(n-1) * (a(n-1) + 1)} for n > 1. 1
1, 2, 6, 2, 6, 42, 14, 6, 6, 2, 6, 6, 14, 210, 30, 2, 6, 6, 2, 6, 42, 2, 6, 6, 2, 6, 42, 14, 30, 930, 62, 6, 6, 14, 210, 6, 2, 6, 6, 2, 6, 42, 86, 6, 6, 2, 6, 42, 14, 30, 6, 2, 6, 6, 14, 42, 6, 2, 6, 6, 2, 6, 42, 2, 6, 6, 2, 6, 42, 14, 6, 6, 2, 6, 6, 14, 42, 6, 2, 6, 6, 2, 6, 42, 86, 7482 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

a(31) = gcd(31 * 32, a(30) * (a(30) + 1)) = gcd(31*32, 930*931) = 62

MATHEMATICA

RecurrenceTable[{a[1]==1, a[n]==GCD[n(n+1), a[n-1](a[n-1]+1)]}, a, {n, 90}] (* Harvey P. Dale, Dec 21 2011 *)

PROG

(PARI) { for (n=1, 1000, if (n>1, a=gcd(n*(n + 1), a*(a + 1)), a=1); write("b062321.txt", n, " ", a) ) } \\ Harry J. Smith, Aug 04 2009

CROSSREFS

Sequence in context: A170861 A229578 A078992 * A229479 A086356 A242435

Adjacent sequences:  A062318 A062319 A062320 * A062322 A062323 A062324

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Jul 05 2001

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 December 9 00:32 EST 2019. Contains 329871 sequences. (Running on oeis4.)