login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A273515 The number of times n is rejected from the Stanley sequence S(0,1), A005836. 1
0, 0, 4, 0, 0, 5, 4, 4, 5, 0, 0, 4, 0, 0, 6, 5, 5, 7, 4, 4, 12, 4, 4, 7, 5, 5, 6, 0, 0, 4, 0, 0, 5, 4, 4, 5, 0, 0, 4, 0, 0, 7, 6, 6, 9, 5, 5, 14, 5, 5, 10, 7, 7, 9, 4, 4, 12, 4, 4, 14, 12, 12, 14, 4, 4, 12, 4, 4, 9, 7, 7, 10, 5, 5, 14, 5, 5, 9, 6, 6, 7, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

This sequence gives the number of times n is a member of an arithmetic triple a<b<c (three numbers in arithmetic progression) for which the other two terms are members of A005836. A005836 is the minimal sequence that disallows any arithmetic triples.

LINKS

Max Barrentine, Table of n, a(n) for n = 0..19683

FORMULA

a(n) = A273513(n) + A273514(n) + A262097(n).

CROSSREFS

Cf. A005836, A262097, A273513, A273514, A273516.

Sequence in context: A151673 A005397 A259124 * A021718 A193108 A212044

Adjacent sequences:  A273512 A273513 A273514 * A273516 A273517 A273518

KEYWORD

nonn,base

AUTHOR

Max Barrentine, May 23 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 January 22 01:29 EST 2019. Contains 319351 sequences. (Running on oeis4.)