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.

A261677 Numbers whose representation as a sum of palindromes using the greedy algorithm requires more than are needed using the optimal algorithm.

Original entry on oeis.org

302, 403, 504, 605, 706, 807, 908, 1011, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1032, 1033, 1035, 1036, 1037, 1038, 1039, 1040, 1043, 1044, 1046, 1047, 1048, 1049, 1050, 1054, 1055, 1057, 1058
Offset: 1

Views

Author

N. J. A. Sloane, Sep 02 2015

Keywords

Comments

Numbers n such that A088601(n) > A261675(n).

Crossrefs