A158919 -id:A158919 - cp's OEIS frontend

A277728 Numbers not in any of A158919, A277722, A277723.

2, 4, 8, 15, 17, 19, 21, 26, 28, 32, 35, 39, 41, 46, 48, 52, 59, 61, 63, 65, 70, 72, 76, 78, 83, 85, 89, 92, 96, 100, 102, 107, 109, 113, 116, 120, 122, 127, 129, 133, 140, 144, 146, 151, 153, 157, 159, 164, 166, 170, 173, 177, 181, 184, 188, 190, 195, 197, 201, 203, 208, 210, 212, 214, 221

Offset: 1

N. J. A. Sloane, Oct 30 2016

nonn

Let tau be the tribonacci constant (A058265). Although 1/tau + 1/tau^2 + 1/tau^3 = 1, by Uspensky's 1927 theorem, the three sequences floor(n*tau) (A158919), floor(n*tau^2) (A277722), and floor(n*tau^3) (A277723) cannot form a partition of the nonnegative integers. (Compare Beatty's theorem.)
Entries A277724-A277727 investigate how these three sequences meet, and the present sequence gives the numbers not in any of the three sequences. Any two of the three sequences have a nontrivial intersection, while the intersection of all three is {0}.
On the other hand, the three sequences A003144, A003145, A003146, which arise from the tribonacci word, DO form a partition of the positive integers and are closely connected with the three sequences mentioned in the definition.
It would be nice to have b-files for all the sequences mentioned here. (Many do, but some do not.)

Jean-François Alcover, Table of n, a(n) for n = 1..2955
S. Beatty, A. Ostrowski, J. Hyslop, and A. C. Aitken, Problems and Solutions: Solutions: 3177, Amer. Math. Monthly, 34 (1927), pp. 159-160.
R. L. Graham, On a theorem of Uspensky, Amer. Math. Mnthly, 70 (1963): 407-409.
A. J. Hildebrand, Junxian Li, Xiaomin Li, Yun Xie, Almost Beatty Partitions, arXiv:1809.08690 [math.NT], 2018.
J. V. Uspensky, On a problem arising out of the theory of a certain game, Amer. Math. Mnthly., 34 (1927), 516-521.

Cf. A003144, A003145, A003146, A058265, A158919, A184820, A277722, A277723, A277724, A277725, A277726, A277727.

maxTerm = 10000;
a19[n_] := Floor[n*Root[#^3 - #^2 - # - 1&, 1]];
a22[n_] := Floor[n*Root[#^3 - 3 #^2 - # - 1&, 1]];
a23[n_] := Floor[n*Root[#^3 - 7 #^2 + 5 # - 1&, 1]];
A19 = Reap[k = 1; While[a19[k] <= maxTerm, Sow[a19[k++]]]][[2, 1]];
A22 = Reap[k = 1; While[a22[k] <= maxTerm, Sow[a22[k++]]]][[2, 1]];
A23 = Reap[k = 1; While[a23[k] <= maxTerm, Sow[a23[k++]]]][[2, 1]];
Select[Range[maxTerm], FreeQ[A19, #] && FreeQ[A22, #] && FreeQ[A23, #]&] (* Jean-François Alcover, Dec 06 2018 *)

A276383 Complement of A158919: complementary Beatty sequence to the Beatty sequence defined by the tribonacci constant tau = A058265.

Original entry on oeis.org

2, 4, 6, 8, 10, 13, 15, 17, 19, 21, 24, 26, 28, 30, 32, 35, 37, 39, 41, 43, 46, 48, 50, 52, 54, 56, 59, 61, 63, 65, 67, 70, 72, 74, 76, 78, 81, 83, 85, 87, 89, 92, 94, 96, 98, 100, 102, 105, 107, 109, 111, 113, 116, 118, 120, 122, 124, 127, 129, 131, 133, 135, 138, 140, 142, 144, 146, 149, 151, 153, 155, 157, 159, 162, 164, 166, 168, 170, 173, 175, 177, 179, 181, 184, 186, 188, 190, 192, 195, 197, 199, 201, 203, 205, 208, 210, 212, 214, 216, 219, 221, 223, 225, 227, 230, 232, 234, 236, 238, 241, 243

Offset: 1

N. J. A. Sloane, Sep 02 2016

nonn

This is the Beatty sequence for tau_prime = 2.191487883953118747061354268227517294...,
defined by 1/tau + 1/tau_prime = 1.
Differs from A172278 at n = 162, 209, 256, 303, 324, ...
Note that Beatty sequences do not normally include 0 - see the classic pair A000201, A001950. - N. J. A. Sloane, Oct 19 2018
Note that the tribonacci numbers T = A000073 related to the ternary sequence A080843 lead to the three complementary sequences for the nonnegative integers AT(n) = A278040(n), BT(n) = A278039(n) and CT(n) = A278041(n). - Wolfdieter Lang, Sep 08 2018

			Comments from _Wolfdieter Lang_, Sep 08 2018 (Start):
The complementary sequences A158919 and A276383 begin:
n:       1 2 3 4  5  6  7  8  9 10 11 12 13 14 15 16 17 18 19 20 ...
A158919: 1 3 5 7  9 11 12 14 16 18 20 22 23 25 27 29 31 33 34 36 ...
A276383: 2 4 6 8 10 13 15 17 19 21 24 26 28 30 32 35 37 39 41 43 ...
--------------------------------------------------------------------
The complementary sequences AT, BT and CT begin:
n:  0  1  2  3  4  5  6  7  8  9 10 11 12 13 14 15  16  17  18  19 ...
AT: 1  5  8 12 14 18 21 25 29 32 36 38 42 45 49 52  56  58  62  65 ...
BT: 0  2  4  6  7  9 11 13 15 17 19 20 22 24 26 28  30  31  33  35 ...
CT: 3 10 16 23 27 34 40 47 54 60 67 71 78 84 91 97 104 108 115 121 ...
(End)

R. J. Mathar, Table of n, a(n) for n = 1..1000
Wikipedia, Beatty Sequence

Cf. A000201, A001950, A058265, A158919.
Cf. also A000073, A080843, A276383, A278039, A278040, A278041, A316711.
Similar to but strictly different from A172278.

A276383 := proc(n)
    Tau := (1/3)*(1+(19+3*sqrt(33))^(1/3)+(19-3*sqrt(33))^(1/3));
    taupr := 1/(1-1/Tau) ;
    floor(n*taupr) ;
end proc: # R. J. Mathar, Sep 04 2016
a:=proc(n) local s,t; t:=evalf(solve(x^3-x^2-x-1=0,x),120)[1]; s:=t/(t-1); floor(n*s) end; seq(a(n),n=0..70); # Muniru A Asiru, Oct 16 2018

a(n) = floor(n*tau_prime), with tau_prime = tau/(tau - 1), where tau is the tribonacci constant A058265.

tau_prime = (1 + (19 + 3*sqrt(33))^(1/3) + (19 - 3*sqrt(33))^(1/3)) / (-2 + (19 + 3*sqrt(33))^(1/3) + (19 - 3*sqrt(33))^(1/3)). - Wolfdieter Lang, Sep 08 2018

Edited by N. J. A. Sloane, Oct 19 2018 at the suggestion of Georg Fischer

A058265 Decimal expansion of the tribonacci constant t, the real root of x^3 - x^2 - x - 1.

Original entry on oeis.org

1, 8, 3, 9, 2, 8, 6, 7, 5, 5, 2, 1, 4, 1, 6, 1, 1, 3, 2, 5, 5, 1, 8, 5, 2, 5, 6, 4, 6, 5, 3, 2, 8, 6, 6, 0, 0, 4, 2, 4, 1, 7, 8, 7, 4, 6, 0, 9, 7, 5, 9, 2, 2, 4, 6, 7, 7, 8, 7, 5, 8, 6, 3, 9, 4, 0, 4, 2, 0, 3, 2, 2, 2, 0, 8, 1, 9, 6, 6, 4, 2, 5, 7, 3, 8, 4, 3, 5, 4, 1, 9, 4, 2, 8, 3, 0, 7, 0, 1, 4

Offset: 1

Robert G. Wilson v, Dec 07 2000

"The tribonacci constant, the only real solution to the equation x^3 - x^2 - x - 1 = 0, which is related to tribonacci sequences (in which U_n = U_n-1 + U_n-2 + U_n-3) as the Golden Ratio is related to the Fibonacci sequence and its generalizations. This ratio also appears when a snub cube is inscribed in an octahedron or a cube, by analogy once again with the appearance of the Golden Ratio when an icosahedron is inscribed in an octahedron. [John Sharp, 1997]"
The tribonacci constant corresponds to the Golden Section in a tripartite division 1 = u_1 + u_2 + u_3 of a unit line segment; i.e., if 1/u_1 = u_1/u_2 = u_2/u_3 = c, c is the tribonacci constant. - Seppo Mustonen, Apr 19 2005
The other two polynomial roots are the complex-conjugated pair -0.4196433776070805662759262... +- i* 0.60629072920719936925934... - R. J. Mathar, Oct 25 2008
For n >= 3, round(q^prime(n)) == 1 (mod 2*prime(n)). Proof in Shevelev link. - Vladimir Shevelev, Mar 21 2014
Concerning orthogonal projections, the tribonacci constant is the ratio of the diagonal of a square to the width of a rhombus projected by rotating a square along its diagonal in 3D until the angle of rotation equals the apparent apex angle at approximately 57.065 degrees (also the corresponding angle in the formula generating A256099). See illustration in the links. - Peter M. Chema, Jan 02 2017
From Wolfdieter Lang, Aug 10 2018: (Start)
Real eigenvalue t of the tribonacci Q-matrix <<1, 1, 1>,<1, 0, 0>,<0, 1, 0>>.
Limit_{n -> oo} T(n+1)/T(n) = t (from the T recurrence), where T = {A000073(n+2)}_{n >= 0}. (End)
The nonnegative powers of t are t^n = T(n)*t^2 + (T(n-1) + T(n-2))*t + T(n-1)*1, for n >= 0, with T(n) = A000073(n), with T(-1) = 1 and T(-2) = -1, This follows from the recurrences derived from t^3 = t^2 + t + 1. See the examples below. For the negative powers see A319200. - Wolfdieter Lang, Oct 23 2018
Note that we have: t + t^(-3) = 2, and the k-nacci constant approaches 2 when k approaches infinity (Martin Gardner). - Bernard Schott, May 16 2022
The roots of this cubic are found from those of y^3 - (4/3)*y - 38/27, after adding 1/3. - Wolfdieter Lang, Aug 24 2022
The algebraic number t - 1 has minimal polynomial x^3 + 2*x^2 - 2 over Q. The roots coincide with those of y^3 - (4/3)*y - 38/27, after subtracting 2/3. - Wolfdieter Lang, Sep 20 2022
The value of the ratio R/r of the radius R of a uniform ball to the radius r of a spherical hole in it with a common point of contact, such that the center of gravity of the object lies on the surface of the spherical hole (Schmidt, 2002). - Amiram Eldar, May 20 2023

			1.8392867552141611325518525646532866004241787460975922467787586394042032220\
    81966425738435419428307014141979826859240974164178450746507436943831545\
    820499513796249655539644613666121540277972678118941041...
From _Wolfdieter Lang_, Oct 23 2018: (Start)
The coefficients of t^2, t, 1 for t^n begin, for n >= 0:
    n     t^2    t    1
    -------------------
    0      0     0    1
    1      0     1    0
    2      1     0    0
    1      1     1    1
    4      2     2    1
    5      4     3    2
    6      7     6    4
    7     13    11    7
    8     24    20   13
    9     44    37   24
   10     81    68   44
...  (End)

Steven R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.2.2.
Martin Gardner, The Second Scientific American Book of Mathematical Puzzles and Diversions, "Phi: The Golden Ratio", Chapter 8, p. 101, Simon & Schuster, NY, 1961.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Revised Edition, Penguin Books, London, England, 1997, page 23.

Harry J. Smith, Table of n, a(n) for n = 1..20000
A. Beha et al., The convergence of diffy boxes, American Mathematical Monthly, Vol. 112 (2005), pp. 426-439.
F. Michel Dekking, Jeffrey Shallit, and N. J. A. Sloane, Queens in exile: non-attacking queens on infinite chess boards, Electronic J. Combin., 27:1 (2020), Article P1.52.
O. Deveci, Y. Akuzum, E. Karaduman, and O. Erdag, The Cyclic Groups via Bezout Matrices, Journal of Mathematics Research, Vol. 7, No. 2 (2015), pp. 34-41.
Ömür Deveci, Zafer Adıgüzel, and Taha Doğan, On the Generalized Fibonacci-circulant-Hurwitz numbers, Notes on Number Theory and Discrete Mathematics, Vol. 26, No. 1 (2020), 179-190.
Peter M. Chema, Tribonacci constant as ratio of square to rhombus projection.
Wolfdieter Lang, The Tribonacci and ABC Representations of Numbers are Equivalent, arXiv preprint arXiv:1810.09787 [math.NT], 2018.
S. Litsyn and Vladimir Shevelev, Irrational Factors Satisfying the Little Fermat Theorem, International Journal of Number Theory, Vol. 1, No. 4 (2005), 499-512.
Xerardo Neira, A geometric construction of the tribonacci constant with marked ruler and compass.
Tito Piezas III, Tribonacci constant and Pi.
Simon Plouffe, Tribonacci constant to 2000 digits.
Simon Plouffe, The Tribonacci constant(to 1000 digits).
Herbert C. H. Schmidt, Problem 2670, Crux Mathematicorum, Vol. 28, No. 7 (2002), pp. 464-465.
Vladimir Shevelev, A property of n-bonacci constant, Seqfan (Mar 23 2014).
Nikita Sidorov, Expansions in non-integer bases: Lower, middle and top orders, Journal of Number Theory, Volume 129, Issue 4, April 2009, Pages 741-754. See Lemma 4.1 p. 750.
Kees van Prooijen, The Odd Golden Section.
Kees van Prooijen, Tribonacci Box (analog of Golden Rectangle).
Eric Weisstein's World of Mathematics, Tribonacci Number.
Eric Weisstein's World of Mathematics, Tribonacci Constant.
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number.
Index entries for algebraic numbers, degree 3

Cf. A000073, A019712 (continued fraction), A133400, A254231, A158919 (spectrum = floor(n*t)), A357101 (x^3-2*x^2-2).
Cf. A192918 (reciprocal), A276800 (square), A276801 (cube), A319200.
k-nacci constants: A001622 (Fibonacci), this sequence (tribonacci), A086088 (tetranacci), A103814 (pentanacci), A118427 (hexanacci), A118428 (heptanacci).

Digits:=200; fsolve(x^3=x^2+x+1); # N. J. A. Sloane, Mar 16 2019

RealDigits[ N[ 1/3 + 1/3*(19 - 3*Sqrt[33])^(1/3) + 1/3*(19 + 3*Sqrt[33])^(1/3), 100]] [[1]]
RealDigits[Root[x^3-x^2-x-1,1],10,120][[1]] (* Harvey P. Dale, Mar 23 2019 *)

set_display(none)$ fpprec:100$ bfloat(rhs(solve(t^3-t^2-t-1,t)[3])); /* Dimitri Papadopoulos, Nov 09 2023 */

default(realprecision, 20080); x=solve(x=1, 2, x^3 - x^2 - x - 1); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b058265.txt", n, " ", d));  \\ Harry J. Smith, May 30 2009

q=(1+sqrtn(19+3*sqrt(33),3)+sqrtn(19-3*sqrt(33),3))/3 \\ Use \p# to set 'realprecision'. - M. F. Hasler, Mar 23 2014

t = (1/3)*(1+(19+3*sqrt(33))^(1/3)+(19-3*sqrt(33))^(1/3)). - Zak Seidov, Jun 08 2005
t = 1 - Sum_{k>=1} A057597(k+2)/(T_k*T_(k+1)), where T_n = A000073(n+1). - Vladimir Shevelev, Mar 02 2013
1/t + 1/t^2 + 1/t^3 = 1/A058265 + 1/A276800 + 1/A276801 = 1. - N. J. A. Sloane, Oct 28 2016
t = (4/3)*cosh((1/3)*arccosh(19/8)) + 1/3. - Wolfdieter Lang, Aug 24 2022
t = 2 - Sum_{k>=0} binomial(4*k + 2, k)/((k + 1)*2^(4*k + 3)). - Antonio Graciá Llorente, Oct 28 2024

A140099 A Beatty sequence: a(n) = [n*(1+t)], where t = tribonacci constant (A058265); complement of A140098.

Original entry on oeis.org

2, 5, 8, 11, 14, 17, 19, 22, 25, 28, 31, 34, 36, 39, 42, 45, 48, 51, 53, 56, 59, 62, 65, 68, 70, 73, 76, 79, 82, 85, 88, 90, 93, 96, 99, 102, 105, 107, 110, 113, 116, 119, 122, 124, 127, 130, 133, 136, 139, 141, 144, 147, 150, 153, 156, 159, 161, 164, 167, 170, 173

Offset: 1

Paul D. Hanna, Jun 01 2008

nonn

Note that A276385 agrees with this sequence for n <= 17160 but disagrees beyond that point. In fact a(17161) = 48725, whereas A276385(17161) = 48724. - N. J. A. Sloane, Sep 03 2016

Also somewhat similar to but different from A109232. - N. J. A. Sloane, Sep 04 2016

			Tribonacci constant: t = 1.839286755214161132551852564653286600...

Harvey P. Dale and N. J. A. Sloane, Table of n, a(n) for n = 1..20000, Aug 29 2016 (First 1000 terms from Harvey P. Dale)
N. J. A. Sloane, Table of n, a(n) for n = 1..100000

Cf. A140098 (complement), A140101, A058265, A109232, A276385.

See also A158919 (Beatty sequence for tribonacci constant tau), A275926 (deviation from A140101).

With[{tc=1/3 (1+Surd[19-3Sqrt[33],3])+1/3 Surd[19+3Sqrt[33],3]},Array[ Floor[ (1+tc)*#]&,70]] (* Harvey P. Dale, Dec 05 2013 *)

{a(n)=local(t=(1+(19+3*sqrt(33))^(1/3)+(19-3*sqrt(33))^(1/3))/3);floor(n*(1+t))}

For n >= 1, a(n) = A158919(n)+n. - N. J. A. Sloane, Sep 04 2016

A277722 a(n) = floor(n*tau^2) where tau is the tribonacci constant (A058265).

Original entry on oeis.org

0, 3, 6, 10, 13, 16, 20, 23, 27, 30, 33, 37, 40, 43, 47, 50, 54, 57, 60, 64, 67, 71, 74, 77, 81, 84, 87, 91, 94, 98, 101, 104, 108, 111, 115, 118, 121, 125, 128, 131, 135, 138, 142, 145, 148, 152, 155, 158, 162, 165, 169, 172, 175, 179, 182, 186, 189, 192, 196, 199, 202, 206, 209, 213, 216, 219

Offset: 0

N. J. A. Sloane, Oct 30 2016

nonn

JungHwan Min, Table of n, a(n) for n = 0..10000
A. J. Hildebrand, Junxian Li, Xiaomin Li and Yun Xie, Almost Beatty Partitions, arXiv:1809.08690 [math.NT], 2018.

Cf. A058265, A158919, A276800, A277723.

A277722 := proc(n)
    a276800 :=  3.3829757679062374941227085364550345869493820437485761820195626772353718960099402922235933340043661396041006 ;
    floor(n*a276800) ;
end proc:
seq(A277722(n),n=0..100) ; # R. J. Mathar, Nov 02 2016

A277722[n_] := Floor[n (1/3 (1 + (19 - 3 Sqrt[33])^(1/3) + (19 + 3 Sqrt[33])^(1/3)))^2]; Array[A277722, 66, 0] (* JungHwan Min, Nov 06 2016 *)

A277723 a(n) = floor(n*tau^3) where tau is the tribonacci constant (A058265).

Original entry on oeis.org

0, 6, 12, 18, 24, 31, 37, 43, 49, 56, 62, 68, 74, 80, 87, 93, 99, 105, 112, 118, 124, 130, 136, 143, 149, 155, 161, 168, 174, 180, 186, 192, 199, 205, 211, 217, 224, 230, 236, 242, 248, 255, 261, 267, 273, 280, 286, 292, 298, 304, 311, 317, 323, 329, 336, 342, 348, 354, 360, 367, 373, 379, 385

Offset: 0

N. J. A. Sloane, Oct 30 2016

Jon E. Schoenfield, Table of n, a(n) for n = 0..10000
A. J. Hildebrand, Junxian Li, Xiaomin Li, Yun Xie, Almost Beatty Partitions, arXiv:1809.08690 [math.NT], 2018.

Cf. A058265, A158919, A276801, A277722.

a(n)=n*polrootsreal(x^3-7*x^2+5*x-1)[1]\1 \\ Charles R Greathouse IV, Nov 06 2016

By definition, a(n) = n*tau^3 + O(1). - Charles R Greathouse IV, Nov 06 2016

A277726 Intersection of A277722 and A277723.

Original entry on oeis.org

0, 6, 37, 43, 74, 87, 118, 155, 186, 192, 199, 230, 236, 267, 280, 304, 311, 317, 348, 385, 392, 416, 429, 460, 466, 497, 504, 510, 541, 578, 622, 659, 690, 696, 703, 734, 740, 771, 784, 808, 815, 852, 889, 896, 920, 933, 964, 970, 1001, 1008, 1014, 1045, 1082, 1126, 1163, 1194, 1200, 1207, 1238, 1244, 1275, 1288, 1312, 1319, 1356, 1387, 1393, 1400, 1424

Offset: 1

N. J. A. Sloane, Oct 30 2016

nonn

See A277728 for discussion.

Cf. A003144, A003145, A003146, A058265, A158919, A275926, A276799, A276800, A277722, A277723, A277724, A277725, A277726, A277727, A277728.

Digits := 120;
isA277722 := proc(n)
    a276800 :=  3.3829757679062374941227085364550345869493820437485761820195626772353718960099402922235933340043661396041006 ;
    for x from floor((n-3)/a276800) to (n+3)/a276800 do
        if floor(x*a276800) = n then
            return true;
        end if;
    end do:
    return false;
end proc:
isA277723 := proc(n)
    a276801 :=  6.2222625231203986266745611011083211873735607898461684287983213166395751180919067179620287534326731537460804;
    for x from floor((n-3)/a276801) to (n+3)/a276801 do
        if floor(x*a276801) = n then
            return true;
        end if;
    end do:
    return false;
end proc:
isA277726 := proc(n)
    isA277722(n) and isA277723(n) ;
end proc:
for n from 0 to 8000 do
    if isA277726(n) then
        printf("%d,",n) ;
    end if;
end do: # R. J. Mathar, Nov 02 2016

Corrected by R. J. Mathar, Nov 01 2016

cp's OEIS Frontend

A277724 Intersection of A158919 and A277722.

Views

Author

Keywords

Comments

Crossrefs

A277725 Intersection of A158919 and A277723.

Views

Author

Keywords

Comments

Crossrefs

A277727 Union of A158919, A277722, A277723.

Views

Author

Keywords

Comments

Crossrefs

A277728 Numbers not in any of A158919, A277722, A277723.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A276383 Complement of A158919: complementary Beatty sequence to the Beatty sequence defined by the tribonacci constant tau = A058265.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula

Extensions

A058265 Decimal expansion of the tribonacci constant t, the real root of x^3 - x^2 - x - 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Maxima

PARI

PARI

Formula

A140099 A Beatty sequence: a(n) = [n*(1+t)], where t = tribonacci constant (A058265); complement of A140098.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A277722 a(n) = floor(n*tau^2) where tau is the tribonacci constant (A058265).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

A277723 a(n) = floor(n*tau^3) where tau is the tribonacci constant (A058265).

Views

Author