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.

A354442 The primes sums formed for each completed 3 X 3 square of numbers in A354441.

Original entry on oeis.org

47, 61, 79, 71, 103, 89, 127, 107, 127, 167, 127, 139, 193, 167, 173, 191, 239, 193, 197, 223, 307, 257, 257, 251, 263, 331, 281, 271, 277, 307, 379, 337, 347, 359, 349, 353, 431, 379, 379, 397, 409, 439, 499, 449, 439, 463, 457, 461, 479, 569, 499, 491, 509, 521, 523, 557, 643, 557, 563, 599, 613
Offset: 1

Views

Author

Scott R. Shannon, May 29 2022

Keywords

Comments

See A354441 for further details.
In the first one million terms the most frequently occurring prime sum is 8986531, which occurs twenty-eight times. It is unknown if the maximum number of times a prime sum can occur is finite or unbounded.

Examples

			The first prime sum is 47, which is the sum of the innermost nine values 1,2,3,4,5,6,7,8,11 which form the 3 X 3 square centered at (0,0) in the square spiral shown in A354441.
The second prime sum is 61, which is the sum of the nine values 1,2,3,4,8,9,10,11,13 which form the 3 X 3 square centered at (1,0) in the square spiral shown in A354441.
		

Crossrefs