A103298 Number of segments of a perfect ruler with length n.

0, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14

Offset

0,3

Comments

For definitions, references and links related to complete rulers see A103294.

Links

F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, Table of n, a(n) for n = 0..244

F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, MRLA search results and source code, Nov 6 2020.

F. Schwartau, Y. Schröder, L. Wolf and J. Schoebel, Large Minimum Redundancy Linear Arrays: Systematic Search of Perfect and Optimal Rulers Exploiting Parallel Processing, IEEE Open Journal of Antennas and Propagation, 2 (2021), 79-85.

Index entries for sequences related to perfect rulers.

Formula

a(n) = A046693(n) - 1.

Example

a(11)=5 means that a perfect ruler with length 11 has 5 segments.

Crossrefs

Cf. A046693, A103297.

Sequence in context: A132914 A370461 A060646 * A082429 A047744 A163563

Adjacent sequences: A103295 A103296 A103297 * A103299 A103300 A103301

Keyword

nonn

Author

Peter Luschny, Feb 28 2005

Extensions

Extended using A046693 terms by Vaclav Kotesovec, Oct 20 2019

Status

approved