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!)
A156833 A054525 * A156348 * [1,2,3,...] 5

%I #9 Oct 15 2023 11:20:11

%S 1,2,3,6,5,16,7,24,24,38,11,103,13,68,127,144,17,261,19,404,291,152,

%T 23,994,370,206,540,1093,29,2195,31,1584,943,338,2543,4808,37,416,

%U 1479,7371,41,7929,43,4691,8976,596,47,18876,6510,11035,3091

%N A054525 * A156348 * [1,2,3,...]

%C Conjecture: for n>1, a(n) = n iff n is prime.

%C Companion to A156834: (1, 2, 3, 5, 5, 12, 7, 17, 19,...).

%F A054525 * A156348 * [1,2,3,...]

%e a(4) = 6 since first 4 terms of A156348 * [1, 2, 3, 4,...] = (1, 3, 4, 9);

%e Then (1, 3, 4, 9) dot (0, -1, 0, 1) = (0 - 3 + 0 + 9) = 6. Row 4 of A054525 = (0, -1, 0, 1).

%p A156833T := proc(n,k)

%p add(A054525(n,j)*A156348(j,k),j=k..n) ;

%p end proc:

%p A156833 := proc(n)

%p add(A156833T(n,k)*k,k=1..n) ;

%p end proc: # _R. J. Mathar_, Mar 03 2013

%t A054525[n_, k_] := If[Divisible[n, k], MoebiusMu[n/k], 0];

%t A156348[n_, k_] := Which[k < 1 || k > n, 0, Mod[n, k] == 0, Binomial[n/k - 2 + k, k - 1], True, 0];

%t T[n_, k_] := Sum[A054525[n, j]*A156348[j, k], {j, k, n}];

%t a[n_] := Sum[T[n, k]*k, {k, 1, n}];

%t Table[a[n], {n, 1, 51}] (* _Jean-François Alcover_, Oct 15 2023 *)

%Y Cf. A156348, A054525, A156834

%K nonn

%O 1,2

%A _Gary W. Adamson_, Feb 16 2009

%E Extended beyond a(14) by _R. J. Mathar_, Mar 03 2013

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 April 24 11:49 EDT 2024. Contains 371936 sequences. (Running on oeis4.)