cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A330909 Floor of area of triangle whose sides are consecutive Ulam numbers (A002858).

Original entry on oeis.org

0, 2, 5, 11, 23, 43, 70, 100, 141, 227, 361, 478, 670, 826, 1044, 1183, 1405, 1668, 1960, 2272, 2545, 2889, 3351, 3819, 4267, 4523, 4955, 5669, 6558, 7474, 8203, 8914, 9633, 10813, 12245, 13611, 13972, 14587, 15473, 16798, 17987, 19298, 20229, 21909, 23166
Offset: 1

Views

Author

Frank M Jackson, May 01 2020

Keywords

Comments

It has been proved that three consecutive Ulam numbers U(n) for n > 1 satisfy the triangle inequality. See Wikipedia link below.

Examples

			a(2) = 2 because the triangle with sides (2, 3, 4) has area 3*sqrt(15)/4 = 2.9047...
		

Crossrefs

Programs

  • Mathematica
    lst1 = ReadList["https://oeis.org/A002858/b002858.txt", {Number,Number}]; lst={}; Do[{a, b, c}={lst1[[n]][[2]], lst1[[n+1]][[2]], lst1[[n+2]][[2]]}; s = (a+b+c)/2; A=Sqrt[s(s-a)(s-b)(s-c)]; AppendTo[lst, Floor@A], {n, 1, 50}]; lst

Formula

Given a triangle with sides a, b and c, the area A = sqrt(s(s-a)(s-b)(s-c)) where s = (a+b+c)/2.

A347212 a(n) is the next Ulam number (A002858) after 2^(n-1).

Original entry on oeis.org

1, 2, 3, 6, 11, 18, 36, 69, 131, 258, 522, 1025, 2054, 4101, 8194, 16394, 32817, 65542, 131085, 262183, 524313, 1048588, 2097164, 4194310, 8388624, 16777218, 33554433, 67108881, 134217730, 268435473, 536870927, 1073741861
Offset: 0

Views

Author

Frank M Jackson, Sep 02 2021

Keywords

Comments

This sequence appears to be a "complete" (sic) sequence as defined in the Wikipedia link.

Examples

			a(0) = 1 because 1 is the next Ulam number after 2^(-1) = 1/2.
a(6) = 36 because 36 is the next Ulam number after 2^5 = 32.
		

Crossrefs

Programs

  • Mathematica
    ulams={1, 2}; Do[AppendTo[ulams, n=Last[ulams]; While[n++; Length[DeleteCases[Intersection[ulams, n-ulams], n/2, 1, 1]]!= 2]; n], {10^4}]; lst=ulams; nextu[n_] := Module[{m = 1}, While[lst[[m]]<=n, m++]; lst[[m]]]; Join[{1}, Table[nextu[2^(n - 1)], {n, 1, 18}]]

Extensions

a(22)-a(31) from Amiram Eldar, Sep 02 2021
Showing 1-2 of 2 results.