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.

A160393 Square root of A003462, rounded up.

Original entry on oeis.org

1, 2, 4, 7, 11, 20, 34, 58, 100, 172, 298, 516, 893, 1547, 2679, 4640, 8036, 13918, 24107, 41754, 72320, 125262, 216960, 375786, 650880, 1127357, 1952639, 3382070, 5857917, 10146210, 17573751, 30438629, 52721251, 91315885, 158163753, 273947655, 474491257, 821842965
Offset: 1

Views

Author

Jack W Grahl, May 12 2009

Keywords

Comments

This sequence gives a lower bound for A090246. A003462 is the number of points in P(Z/3Z)^n. If a subset of P(Z/3Z)^n contains m points with no 3 collinear, then there are at most 2*C(m,2) points which are collinear with 2 points of the subset. Therefore if m + 2*C(m,2) = m^2 < A003462(n) we can add at least one more point to the set.

Crossrefs

Programs

  • PARI
    a(n) = sqrtint((3^n-3)/2)+1; \\ Michel Marcus, Oct 20 2016; corrected Jun 15 2022

Formula

a(n) = ceiling(sqrt((3^n-1)/2)).