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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

N. J. A. Sloane, Table of n, a(n) for n = 1..5351

CROSSREFS

Cf. A002113, A088601, A261675.

Sequence in context: A068258 A075407 A258449 * A004227 A255144 A098241

Adjacent sequences:  A261674 A261675 A261676 * A261678 A261679 A261680

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Sep 02 2015

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 22:08 EST 2022. Contains 350480 sequences. (Running on oeis4.)