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.

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

This page as a plain text file.
%I A278862 #39 Feb 18 2021 00:35:39
%S A278862 157441,177617,178637,226891,374359,900745,1456223,1526983,1545227,
%T A278862 1817999,2232815,2274595,2320643,2336935,2363383,2404487,2461559,
%U A278862 2536595,2812451,2877463,2893769,2910811,2912446,3046915,3053999,3090575,3105319,3382141
%N A278862 Numbers that are not the sum of 2 or fewer terms from A057890.
%C A278862 Not known to be infinite.  This list is complete up to 3,500,000.
%H A278862 Robert Israel, <a href="/A278862/b278862.txt">Table of n, a(n) for n = 1..262</a>
%H A278862 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 A278862 # with A a list of terms < 2^d of A057890
%p A278862 B:= Array(0..2^d-1,datatype=integer[4]):
%p A278862 for a in A do B[a]:= 1 od:
%p A278862 C:= SignalProcessing:-Convolution(B,B):
%p A278862 select(t -> C[t+1] < 0.5, [$0..2^d-1]); # _Robert Israel_, Dec 08 2016
%Y A278862 Cf. A057890.
%K A278862 nonn
%O A278862 1,1
%A A278862 _Jeffrey Shallit_, Dec 07 2016