login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049697 a(n)=T(n,n+1), array T as in A049695. 1

%I #12 May 13 2013 01:47:54

%S 1,3,6,10,16,22,30,40,50,60,74,88,104,122,136,152,176,198,222,248,268,

%T 290,322,352,380,412,442,472,512,548,586,632,668,704,744,780,828,882,

%U 924,964,1020,1072,1126

%N a(n)=T(n,n+1), array T as in A049695.

%F a(n-1)=sum_{k=1...n}mu(k)floor(n/k)ceiling(n/k); a(n) is asymptotic to (6/Pi^2)*n^2 - _Benoit Cloitre_, Jun 27 2005

%o (PARI) a(n)=sum(k=1,n++,n\k*moebius(k)*ceil(n/k)) \\ _Charles R Greathouse IV_, Mar 02 2012

%Y Cf. A018805.

%K nonn

%O 0,2

%A _Clark Kimberling_

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 2 05:59 EDT 2024. Contains 374821 sequences. (Running on oeis4.)