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!)
A309262 a(0) = 0, a(1) = 1, and for any n > 1, a(n) = Sum_{k > 1} a(floor(n/k^2)). 2

%I #13 Jul 22 2019 12:00:23

%S 0,1,0,0,1,1,1,1,0,1,1,1,1,1,1,1,3,3,2,2,2,2,2,2,2,3,3,3,3,3,3,3,1,1,

%T 1,1,4,4,4,4,4,4,4,4,4,4,4,4,4,5,4,4,4,4,4,4,4,4,4,4,4,4,4,4,8,8,8,8,

%U 8,8,8,8,5,5,5,5,5,5,5,5,5,7,7,7,7,7,7

%N a(0) = 0, a(1) = 1, and for any n > 1, a(n) = Sum_{k > 1} a(floor(n/k^2)).

%C For any n > 1 and k > A000196(n), a(floor(n/k^2)) = a(0) = 0, hence the series in the name is well defined.

%C This sequence is a variant of A022825; here we sum terms of the form a(floor(n/k^2)), there terms of the form a(floor(n/k)).

%H Rémy Sigrist, <a href="/A309262/b309262.txt">Table of n, a(n) for n = 0..10000</a>

%e a(5) = a(floor(5/2^2)) = a(1) = 1.

%t Join[{0}, Clear[a]; a[0]=0; a[1]=1; a[n_]:=a[n]=Sum[a[Floor[n/k^2]], {k, 2, n}]; Table[a[n], {n, 1, 100}]] (* _Vincenzo Librandi_, Jul 22 2019 *)

%o (PARI) a(n) = if (n<=1, n, sum (k=2, sqrtint(n), a(n\k^2)))

%Y Cf. A000196, A022825.

%K nonn

%O 0,17

%A _Rémy Sigrist_, Jul 19 2019

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 18:05 EDT 2024. Contains 371962 sequences. (Running on oeis4.)