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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070555 Sum of positive integers k, where k <= n and GCD(k,2n+1) = GCD(k+1,2n+1). 2
1, 1, 6, 15, 12, 45, 66, 21, 120, 153, 50, 231, 180, 117, 378, 435, 144, 255, 630, 209, 780, 861, 198, 1035, 840, 375, 1326, 729, 476, 1653, 1770, 465, 1056, 2145, 714, 2415, 2556, 555, 1710, 3003, 1080, 3321, 1890, 1161, 3828, 2475, 1334, 2397, 4560, 1323 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Note that whenever GCD(k,2n+1) = GCD(k+1,2n+1), this common value must be 1. - David Wasserman, May 13 2003

LINKS

Table of n, a(n) for n=1..50.

PROG

(Matlab) function m = A070555(n) m = 0; for k = 1:(2*n + 1) if gcd(k, 2*n + 1) == gcd(k + 1, 2*n + 1) m = m + k; end end

CROSSREFS

Bisection of A069828.

Sequence in context: A161397 A145257 A245200 * A128512 A201142 A200902

Adjacent sequences:  A070552 A070553 A070554 * A070556 A070557 A070558

KEYWORD

nonn

AUTHOR

Vladeta Jovovic, Apr 29 2002

EXTENSIONS

More terms from David Wasserman, May 13 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified July 24 21:14 EDT 2014. Contains 244897 sequences.