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!)
A248230 a(n) = floor(1/(zeta(4) - Sum_{h=1..n} 1/h^4)). 4

%I #17 Jul 17 2018 02:42:15

%S 12,50,133,280,507,833,1276,1855,2586,3488,4579,5878,7401,9167,11194,

%T 13501,16104,19022,22273,25876,29847,34205,38968,44155,49782,55868,

%U 62431,69490,77061,85163,93814,103033,112836,123242,134269,145936,158259,171257,184948

%N a(n) = floor(1/(zeta(4) - Sum_{h=1..n} 1/h^4)).

%C This sequence provides insight into the manner of convergence of Sum_{h=1..n} 1/h^4.

%H Clark Kimberling, <a href="/A248230/b248230.txt">Table of n, a(n) for n = 1..1000</a>

%H Soumyadip Sahu, <a href="https://arxiv.org/abs/1807.05454">On Certain Reciprocal Sums</a>, arXiv:1807.05454 [math.NT], 2018.

%F Empirically, a(n) = 3*a(n-1) - a(n-2) + a(n-3) + a(n-4) - 3*a(n-5) + 3*a(n-6) - a(n-7).

%F Conjecture: a(n) = 1 + 7*n/2 + 9*n^2/2 + 3*n^3 + floor(n/4), holds for all n <= 10000. - _Vaclav Kotesovec_, Oct 09 2014

%t $MaxExtraPrecision = Infinity; z = 400; p[k_] := p[k] = Sum[1/h^4, {h, 1, k}];

%t N[Table[Zeta[4] - p[n], {n, 1, z/10}]]

%t f[n_] := f[n] = Select[Range[z], Zeta[4] - p[#] < 1/n^3 &, 1];

%t u = Flatten[Table[f[n], {n, 1, z}]] (* A248227 *)

%t Flatten[Position[Differences[u], 0]] (* A248228 *)

%t Flatten[Position[Differences[u], 1]] (* A248229 *)

%t f = Table[Floor[1/(Zeta[4] - p[n])], {n, 1, z}] (* A248230 *)

%Y Cf. A248227, A248228, A248229, A013662.

%K nonn,easy

%O 1,1

%A _Clark Kimberling_, Oct 05 2014

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 25 10:34 EDT 2024. Contains 371967 sequences. (Running on oeis4.)