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.

A260864 Base-14 representation of a(n) is the concatenation of the base-14 representations of 1, 2, ..., n, n-1, ..., 1.

This page as a plain text file.
%I A260864 #20 Jun 29 2019 11:27:02
%S A260864 0,1,225,44521,8732025,1711559641,335466848025,65751518430361,
%T A260864 12887297839395225,2525910379700086681,495078434465717705625,
%U A260864 97035373155903680328601,19018933138565843484771225,3727710895159027432980276121,10228838696316240496325238416281
%N A260864 Base-14 representation of a(n) is the concatenation of the base-14 representations of 1, 2, ..., n, n-1, ..., 1.
%C A260864 See A260343 for the bases b such that A260851(b) = A_b(b) = b*r + (r - b)*(1 + b*r), is prime, where A_b is the base-b sequence, as here with b=14, and r = (b^b-1)/(b-1) is the base-b repunit of length b.
%H A260864 D. Broadhurst, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;af419558.1508">Primes from concatenation: results and heuristics</a>, NmbrThry List, August 1, 2015
%F A260864 For n < b = 14, we have a(n) = R(14,n)^2, where R(b,n) = (b^n-1)/(b-1) are the base-b repunits.
%e A260864 a(0) = 0 is the result of the empty sum corresponding to 0 digits.
%e A260864 a(2) = (14+1)^2 = 14^2 + 2*14 + 1 = 121_14, concatenation of (1, 2, 1).
%e A260864 a(15) = 123456789abcd101110dcba987654321_14 is the concatenation of (1, 2, 3, ..., 9, a, b, c, d, 10, 11, 10, d, ..., 1), where "d, 10, 11" are the base-14 representations of 13, 14, 15.
%o A260864 (PARI) a(n,b=14)=sum(i=1,#n=concat(vector(n*2-1,k,digits(min(k,n*2-k),b))),n[i]*b^(#n-i))
%Y A260864 Base-14 variant of A173426 (base 10) and A173427 (base 2). See A260853 - A260866 for variants in other bases.
%Y A260864 For primes see A261408.
%K A260864 nonn,base
%O A260864 0,3
%A A260864 _M. F. Hasler_, Aug 01 2015