This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A000263 Number of partitions into non-integral powers. (Formerly M2967 N1200) 2
 3, 14, 39, 91, 173, 307, 502, 779, 1150, 1651, 2280, 3090, 4090, 5313, 6787, 8564, 10643, 13103, 15948, 19235, 23000, 27316, 32174, 37677, 43849, 50758, 58427, 66978, 76373, 86765, 98171, 110662, 124310, 139202, 155339, 172885 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 COMMENTS a(n) counts the solutions to the inequality x_1^(1/2)+x_2^(1/2)<=n for any two distinct integers 1<=x_1= x1+1 then a := a+floor(x2-x1) ; fi; od: a ; end: seq(A000263(n), n=3..80) ; # R. J. Mathar, Sep 29 2009 MATHEMATICA A000263[n_] := Module[{a, x1, x2 }, a = 0; For[x1 = 1, x1 <= n^2, x1++, x2 = (n-x1^(1/2))^2; If[Floor[x2] >= x1+1, a = a+Floor[x2-x1]]]; a]; Table[ A000263[n], {n, 3, 80}] (* Jean-François Alcover, Feb 06 2016, after R. J. Mathar *) CROSSREFS Sequence in context: A162147 A319791 A027444 * A102590 A174517 A034130 Adjacent sequences:  A000260 A000261 A000262 * A000264 A000265 A000266 KEYWORD nonn AUTHOR EXTENSIONS More terms from R. J. Mathar, Sep 29 2009 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.

Last modified December 10 18:03 EST 2018. Contains 318049 sequences. (Running on oeis4.)