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.

A323635 Lexicographically earliest sequence of distinct positive integers such that the nested square root sqrt(a(n) + sqrt(a(n-1) + ... + sqrt(a(1))...)) is an integer.

This page as a plain text file.
%I A323635 #28 Aug 12 2022 09:23:13
%S A323635 1,3,2,7,6,13,5,22,4,33,10,12,21,11,32,19,20,31,30,43,9,45,18,44,29,
%T A323635 58,8,60,17,59,28,75,16,76,27,94,15,95,26,115,14,116,25,138,24,163,23,
%U A323635 190,35,42,57,41,74,40,93,39,114,38,137,37,162,36,189,50,56,73,55,92,54,113,53,136
%N A323635 Lexicographically earliest sequence of distinct positive integers such that the nested square root sqrt(a(n) + sqrt(a(n-1) + ... + sqrt(a(1))...)) is an integer.
%C A323635 A permutation of positive integers.
%H A323635 Ivan Neretin, <a href="/A323635/b323635.txt">Table of n, a(n) for n = 1..10000</a>
%H A323635 Mathematics Stack Exchange, <a href="https://math.stackexchange.com/questions/2469058/a-n-is-the-smallest-positive-integer-number-such-that-sqrta-n-sqrta-n-1">a_n is the smallest positive integer number such that ...</a>
%o A323635 (PARI) lista(nn) = {my(va = vector(nn), lastsq); va[1] = 1; lastsq = 1; for (n=2, nn, my(k = ceil(sqrt(sqrtint(lastsq)))); while (#select(x->(x==(k^2-sqrtint(lastsq))), va), k++); va[n] = k^2-sqrtint(lastsq); lastsq = k^2;); va;} \\ _Michel Marcus_, Oct 13 2020
%Y A323635 Cf. A323636 (values of the square roots), A323637 (similar definition with minus).
%K A323635 nonn,look
%O A323635 1,2
%A A323635 _Ivan Neretin_, Jan 21 2019, following a suggestion from Edward Turkevich