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.

A371096 Array A read by upward antidiagonals in which the entry A(n,k) in row n and column k is defined by A(1, k) = 8*k-7, and A(n+1, k) = A371094(A(n, k)), n,k >= 1.

Original entry on oeis.org

1, 21, 9, 5461, 117, 17, 357913941, 11605, 213, 25, 1537228672809129301, 72701269, 87381, 309, 33, 28356863910078205288614550619314017621, 3752999689475413, 91625968981, 30037, 405, 41, 9649340769776349618630915417390658987772498722136713669954798667326094136661, 27043212804868893898596335048021, 100743818301219097892181, 760567125, 79189, 501, 49
Offset: 1

Views

Author

Antti Karttunen, Apr 21 2024

Keywords

Examples

			Array begins:
n\k|         1         2            3          4           5          6
---+--------------------------------------------------------------------
1  |         1,        9,          17,        25,         33,        41,
2  |        21,      117,         213,       309,        405,       501,
3  |      5461,    11605,       87381,     30037,      79189,     48469,
4  | 357913941, 72701269, 91625968981, 760567125, 1968526677, 299193685,
		

Crossrefs

Cf. A371094, A017077 (row 1).
Every fourth column (1, 5, 9, 13, 17, ...) of array A372282.
Cf. also arrays A257852, A371100 and A371102.

Programs

  • PARI
    up_to = 28;
    A371094(n) = { my(m=1+3*n, e=valuation(m,2)); ((m*(2^e)) + (((4^e)-1)/3)); };
    A371096sq(n,k) = if(1==n,8*k-7,A371094(A371096sq(n-1,k)));
    A371096list(up_to) = { my(v = vector(up_to), i=0); for(a=1,oo, for(col=1,a, i++; if(i > up_to, return(v)); v[i] = A371096sq((a-(col-1)),col))); (v); };
    v371096 = A371096list(up_to);
    A371096(n) = v371096[n];