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.

Showing 1-2 of 2 results.

A185438 a(n) = 8*n^2 - 2*n + 1.

Original entry on oeis.org

1, 7, 29, 67, 121, 191, 277, 379, 497, 631, 781, 947, 1129, 1327, 1541, 1771, 2017, 2279, 2557, 2851, 3161, 3487, 3829, 4187, 4561, 4951, 5357, 5779, 6217, 6671, 7141, 7627, 8129, 8647, 9181, 9731, 10297, 10879, 11477, 12091, 12721, 13367, 14029, 14707, 15401, 16111, 16837, 17579
Offset: 0

Views

Author

Paul Curtz, Feb 03 2011

Keywords

Comments

Odd numbers (A005408) written clockwise as a square spiral:
.
41--43--45--47--49--51
| |
39 13--15--17--19 53
| | | |
37 11 1---3 21 55
| | | | |
35 9---7---5 23 57
| | |
33--31--29--27--25 59
|
71--69--67--65--63--61
.
Walking in straight lines away from the center:
1, 17, 49, ... = A069129(n+1) = 1 - 8*n + 8*n^2,
1, 3, 21, ... = A033567(n) = 1 - 6*n + 8*n^2,
1, 15, 45, ... = A014634(n) = 1 + 6*n + 8*n^2,
1, 5, 25, ... = A080856(n) = 1 - 4*n + 8*n^2,
1, 13, 41, ... = A102083(n) = 1 + 4*n + 8*n^2,
1, 7, 29, ... = a(n) = 1 - 2*n + 8*n^2,
1, 11, 37, ... = A188135(n) = 1 + 2*n + 8*n^2,
1, 9, 33, ... = A081585(n) = 1 + 8*n^2,
5, 29, 69, ... = A108928(n+1) = -3 + 8*n^2,
7, 31, 71, ... = A157914(n+1) = -1 + 8*n^2,
9, 35, 77, ... = A033566(n+1) = -1 + 2*n + 8*n^2.
All are quadrisections of sequences in A181407(n) (example: A014634(n) and A033567(n) in A064038(n+1)) or of this family (?): a(n) is a quadrisection of f(n) = 1,1,1,1,2,7,11,8,11,29,37,23,28,67,79,46,... f(n) is just before A064038(n+1) (fifth vertical) in A181407(n). The companion to a(n) is A188135(n), another quadrisection of f(n). Two last quadrisections of f(n) are A054552(n) and A033951(n).
For n >= 1, bisection of A193867. - Omar E. Pol, Aug 16 2011
Also the sequence may be obtained by starting with the segment (1, 7) followed by the line from 7 in the direction 7, 29, ... in the square spiral whose vertices are the generalized hexagonal numbers (A000217). - Omar E. Pol, Aug 01 2016

Crossrefs

Programs

Formula

a(n) = a(n-1) + 16*n - 10 (n > 0).
a(n) = 2*a(n-1) - a(n-2) + 16 (n > 1).
a(n) = 3*(n-1) - 3*a(n-2) + a(n-3) (n > 2).
G.f.: (-1 - 4*x - 11*x^2)/(x-1)^3. - R. J. Mathar, Feb 03 2011
a(n) = A014635(n) + 1. - Bruno Berselli, Apr 09 2011
E.g.f.: exp(x)*(1 + 6*x + 8*x^2). - Elmo R. Oliveira, Nov 17 2024

A182868 a(n) = -1 + n + 4*n^2.

Original entry on oeis.org

-1, 4, 17, 38, 67, 104, 149, 202, 263, 332, 409, 494, 587, 688, 797, 914, 1039, 1172, 1313, 1462, 1619, 1784, 1957, 2138, 2327, 2524, 2729, 2942, 3163, 3392, 3629, 3874, 4127, 4388, 4657, 4934, 5219, 5512, 5813, 6122, 6439, 6764, 7097, 7438, 7787, 8144, 8509, 8882, 9263, 9652
Offset: 0

Views

Author

Paul Curtz, Feb 01 2011

Keywords

Comments

First quadrisection of A176126(n). Take clockwise (square) spiral from A023443(n)=n-1: a(n) is on the negative x-axis. Fourth quadrisection (-1-n+4*n^2) is on the negative y-axis.
Conjecture: the 4 quadrisections of (the family) A064038, A160050, A176126, A178242 (see A181407) come from square spiral.
a(n) mod 9 has period 9: 8,4,8,2,4,5,5,4,2. a(n) mod 10 has period 10: 9,4,7,8,7,4,9,2,3,2. Each polynomial modulo some constant c has a period of length c (and perhaps shorter ones). - Paul Curtz and Bruno Berselli, Feb 05 2011

Programs

Formula

a(n) = A176126(4*n).
a(n) = 4*n^2 + n - 1.
a(n) = a(n-1) - 3 + 8*n.
a(n) = 2*a(n) - a(n-2) + 8.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: -(1 - 7*x - 2*x^2)/(1-x)^3. - Bruno Berselli, Feb 05 2011
Showing 1-2 of 2 results.