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.

A262505 Distance between the positions of the first and the last occurrence of n in A155043: a(n) = A262503(n) - A261089(n).

This page as a plain text file.
%I A262505 #9 Oct 02 2015 12:11:09
%S A262505 0,1,3,7,11,9,13,15,19,21,31,41,49,59,67,77,81,87,55,57,65,59,63,67,
%T A262505 77,79,89,37,27,33,37,47,55,65,67,71,85,99,65,67,77,89,93,103,95,105,
%U A262505 109,117,121,131,135,115,117,119,133,133,153,133,143,141,147,159,175,181,201,205,223,239,245,249,259,275,269,271,273,271,289,303,77
%N A262505 Distance between the positions of the first and the last occurrence of n in A155043: a(n) = A262503(n) - A261089(n).
%H A262505 Antti Karttunen, <a href="/A262505/b262505.txt">Table of n, a(n) for n = 0..110880</a>
%F A262505 a(n) = A262503(n) - A261089(n).
%F A262505 a(n) = A261103(n) + A262506(n).
%o A262505 (Scheme) (define (A262505 n) (- (A262503 n) (A261089 n)))
%Y A262505 Cf. A155043, A259934, A261089, A261103, A262503, A262506.
%Y A262505 Cf. A262508 (positions of zeros).
%Y A262505 Cf. A262507 (the number of occurrences of n in A155043).
%K A262505 nonn
%O A262505 0,3
%A A262505 _Antti Karttunen_, Sep 25 2015