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

%I

%S 302,403,504,605,706,807,908,1011,1013,1014,1015,1016,1017,1018,1019,

%T 1020,1021,1022,1024,1025,1026,1027,1028,1029,1030,1032,1033,1035,

%U 1036,1037,1038,1039,1040,1043,1044,1046,1047,1048,1049,1050,1054,1055,1057,1058

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

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

%H N. J. A. Sloane, <a href="/A261677/b261677.txt">Table of n, a(n) for n = 1..5351</a>

%Y Cf. A002113, A088601, A261675.

%K nonn,base

%O 1,1

%A _N. J. A. Sloane_, Sep 02 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 May 22 09:50 EDT 2022. Contains 353949 sequences. (Running on oeis4.)