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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082457 a(n)=GCD[1+2n, A057643(1+2n)]. 3
1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 15, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 7, 1, 5, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 15, 1, 1, 3, 1, 5, 1, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 7, 1, 1, 15, 1, 1, 1, 1, 1, 3, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,7

EXAMPLE

n=22: 2n+1=45, A057643(45)=5520, a(22)=GCD[45,5520]=15 while A066715[45]=3. This and A066715 are mostly equal; deviating sites see A083344.

MATHEMATICA

di[x_] := Apply[LCM, Divisors[x]+1] Table[GCD[2*w+1, di[1+2*w]], {w, 1, 2048}];

CROSSREFS

Cf. A057643, A066715, A000203.

Sequence in context: A030576 A101874 A066715 * A031178 A091407 A031229

Adjacent sequences:  A082454 A082455 A082456 * A082458 A082459 A082460

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 25 2003

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 15 23:34 EST 2012. Contains 205860 sequences.