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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062828 GCD of 2n and n(n+1)/2. 0
1, 1, 6, 2, 5, 3, 14, 4, 9, 5, 22, 6, 13, 7, 30, 8, 17, 9, 38, 10, 21, 11, 46, 12, 25, 13, 54, 14, 29, 15, 62, 16, 33, 17, 70, 18, 37, 19, 78, 20, 41, 21, 86, 22, 45, 23, 94, 24, 49, 25, 102, 26, 53, 27, 110, 28, 57, 29, 118, 30, 61, 31, 126, 32, 65, 33, 134, 34, 69, 35, 142 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

a(4n+1) = 4n+1, a(4n+2) = 2n+1, a(4n+3) = 8n+6, a(4n+4) = 2n+2. - Ralf Stephan, Jun 10 2005

PROG

(PARI) j=[]; for(n=1, 150, j=concat(j, gcd(2*n, n*(n+1)/2))); j

CROSSREFS

Sequence in context: A007320 A199734 A007321 * A124457 A063720 A006942

Adjacent sequences:  A062825 A062826 A062827 * A062829 A062830 A062831

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 20 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 16 04:18 EST 2012. Contains 205860 sequences.