login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


A261677
Numbers whose representation as a sum of palindromes using the greedy algorithm requires more than are needed using the optimal algorithm.
1
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,1
COMMENTS
Numbers n such that A088601(n) > A261675(n).
LINKS
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Sep 02 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 18:39 EDT 2024. Contains 376136 sequences. (Running on oeis4.)