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.

A043549 Least k for which the integers floor(2*k/m) for m=2,3,...,n are distinct.

This page as a plain text file.
%I A043549 #8 Apr 24 2021 21:47:47
%S A043549 1,1,1,3,6,8,10,15,21,28,32,41,45,55,66,78,91,98,113,128,136,153,171,
%T A043549 190,210,231,242,265,288,313,325,351,378,406,435,465,496,512,545,578,
%U A043549 613,648,666,703,741,780,820,861,903,946,968
%N A043549 Least k for which the integers floor(2*k/m) for m=2,3,...,n are distinct.
%K A043549 nonn
%O A043549 1,4
%A A043549 _Clark Kimberling_