login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065622 Numerator of 1 - (3/4)^n - frac[(3/2)^n)], where frac[x]=x-floor[x]. 1
0, -1, 3, 13, 159, 173, 1767, 12789, 17759, 126237, 292183, 1930245, 3724303, 23940141, 14206087, 99585429, 640559295, 12562430525, 7042526903, 43417422885, 813747135599, 494896655693, 3000760993767, 18098709141429, 249612172740383 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

The presumption that the fraction is positive for n>1 underlies the presumed solution to Waring's problem.

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,200

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

a(n) = 4^n*(1+floor[(3/2)^n])-3^n-6^n = A005061(n)-A002380(n)*A000079(n) = A000302(n)*(1+A002379(n))-A000244(n)-A000400(n).

EXAMPLE

a(3) = 13 since 1-(3/4)^3-frac[(3/2)^3)] = 1-27/64-frac[27/8] = 1-27/64-3/8 = (64-27-24)/64 = 13/64.

PROG

(PARI) { for (n=0, 200, a=numerator(1 - (3/4)^n - frac((3/2)^n)); write("b065622.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 24 2009]

CROSSREFS

Denominator is A000302. Cf. A002804.

Sequence in context: A001150 A108554 A014376 * A140421 A176315 A114317

Adjacent sequences:  A065619 A065620 A065621 * A065623 A065624 A065625

KEYWORD

frac,sign

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Dec 03 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:12 EST 2012. Contains 205694 sequences.