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.

A362212 a(n) is the unique solution to A047994(x) = A361969(n).

Original entry on oeis.org

4, 8, 24, 16, 32, 76, 96, 64, 128, 184, 236, 216, 224, 316, 332, 384, 256, 344, 552, 428, 376, 424, 472, 556, 544, 768, 512, 692, 716, 608, 664, 796, 1128, 892, 908, 896, 1076, 864, 1416, 1132, 944, 1268, 1536, 1024, 1372, 1192, 1436, 1468, 1532, 1992, 1556, 1384
Offset: 1

Views

Author

Amiram Eldar, Apr 11 2023

Keywords

Comments

Are all the terms divisible by 4?

Crossrefs

Similar sequences: A131826, A362211.

Programs

  • Mathematica
    invUPhi[#][[1]]& /@ Select[Range[1250], Length[invUPhi[#]] == 1 &] (* using the function invUPhi from A361966 *)

Formula

a(n) = A135347(A361969(n)).
A047994(a(n)) = A361969(n).

A362665 a(n) is the smaller of the two solutions to A091732(x) = A362664(n).

Original entry on oeis.org

1, 3, 4, 5, 11, 16, 33, 23, 29, 43, 69, 64, 47, 53, 76, 87, 59, 71, 79, 83, 141, 101, 103, 159, 107, 177, 131, 137, 213, 149, 163, 249, 167, 173, 236, 179, 235, 191, 197, 303, 309, 265, 321, 253, 223, 227, 229, 316, 239, 332, 251, 256, 393, 263, 269, 411, 283
Offset: 1

Views

Author

Amiram Eldar, Apr 29 2023

Keywords

Comments

The larger solution is 2*a(n).

Crossrefs

Similar sequences: A131826, A362211, A362212.

Programs

  • Mathematica
    invIPhi[#][[1]]& /@ Select[Range[300], Length[invIPhi[#]] == 2 &] (* using the function invIPhi from A362484 *)
Showing 1-2 of 2 results.