The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A278862 Numbers that are not the sum of 2 or fewer terms from A057890. 1

%I

%S 157441,177617,178637,226891,374359,900745,1456223,1526983,1545227,

%T 1817999,2232815,2274595,2320643,2336935,2363383,2404487,2461559,

%U 2536595,2812451,2877463,2893769,2910811,2912446,3046915,3053999,3090575,3105319,3382141

%N Numbers that are not the sum of 2 or fewer terms from A057890.

%C Not known to be infinite. This list is complete up to 3,500,000.

%H Robert Israel, <a href="/A278862/b278862.txt">Table of n, a(n) for n = 1..262</a>

%H Aayush Rajasekaran, Jeffrey Shallit, and Tim Smith, <a href="https://arxiv.org/abs/1706.10206">Sums of Palindromes: an Approach via Nested-Word Automata</a>, preprint arXiv:1706.10206 [cs.FL], June 30 2017.

%p # with A a list of terms < 2^d of A057890

%p B:= Array(0..2^d-1,datatype=integer[4]):

%p for a in A do B[a]:= 1 od:

%p C:= SignalProcessing:-Convolution(B,B):

%p select(t -> C[t+1] < 0.5, [\$0..2^d-1]); # _Robert Israel_, Dec 08 2016

%Y Cf. A057890.

%K nonn

%O 1,1

%A _Jeffrey Shallit_, Dec 07 2016

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.

Last modified September 24 06:13 EDT 2021. Contains 347623 sequences. (Running on oeis4.)