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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A278490 Leaves in the tree defined by edge relation A255131(child) = parent, the least squares beanstalk. 5
1, 2, 4, 5, 7, 10, 12, 13, 14, 17, 20, 22, 23, 25, 26, 28, 29, 31, 33, 34, 36, 37, 42, 44, 46, 47, 49, 52, 55, 57, 58, 60, 61, 62, 65, 68, 69, 76, 77, 79, 82, 84, 86, 89, 92, 94, 97, 98, 100, 101, 103, 106, 109, 110, 113, 116, 118, 119, 121, 122, 124, 125, 127, 132, 133, 140, 141, 142, 145, 148, 150, 153, 154, 156, 157 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Numbers n for which there are no solutions to k - A002828(k) = n for any k, in other words, numbers n such that (A002828(1+n) <> 1) and (A002828(2+n) <> 2) and (A002828(3+n) <> 3) and (A002828(4+n) <> 4), as the maximum value that A002828 may obtain is 4.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000

PROG

(Scheme, with Antti Karttunen's IntSeq-library)

(define A278490 (ZERO-POS 1 1 A278216))

CROSSREFS

Complement: A278489.

Positions of zeros in A278216.

Cf. A278494 (primes in this sequence).

Sequence in context: A319301 A093013 A272999 * A188029 A187951 A047495

Adjacent sequences:  A278487 A278488 A278489 * A278491 A278492 A278493

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 25 2016

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 April 18 05:11 EDT 2021. Contains 343072 sequences. (Running on oeis4.)