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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049688 a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049687. 1
0, 2, 5, 10, 17, 28, 41, 60, 83, 112, 145, 188, 235, 294, 359, 432, 513, 610, 713, 834, 963, 1104, 1255, 1428, 1609, 1810, 2023, 2254, 2497, 2768, 3047, 3356, 3681, 4026, 4387, 4772, 5169, 5602, 6053, 6528, 7019 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

A131967(a(n)+1) = 1, A131967(a(n)) = 2. - Birkas Gyorgy, Feb 19 2011

Number of triples {A, B, C} where 1<=A<=B<=C<=n+1 and GCD(C-B, B-A)=1. Ex. for n=2, we have the 5 triples {1, 1, 2}, {1, 2, 2}, {2, 2, 3}, {2, 3, 3}, and {1, 2, 3}. - Griffin N. Macris, May 21 2016

LINKS

Griffin N. Macris, Table of n, a(n) for n = 0..99999

FORMULA

a(n) ~ n^2 (3+n) / Pi^2. - Griffin N. Macris, May 21 2016

MATHEMATICA

Table[Sum[Sum[EulerPhi[j], {j, i}] + 1, {i, n}], {n, 0, 30}] (* Birkas Gyorgy, Feb 19 2011 *)

Table[n + Sum[ EulerPhi[ j], {i, n}, {j, i}], {n, 0, 30}] (* Robert G. Wilson v, Feb 12 2015 *)

CROSSREFS

Cf. A049687.

Sequence in context: A007504 A172059 A172435 * A011894 A172512 A172982

Adjacent sequences:  A049685 A049686 A049687 * A049689 A049690 A049691

KEYWORD

nonn

AUTHOR

Clark Kimberling

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 March 26 04:30 EDT 2019. Contains 321481 sequences. (Running on oeis4.)