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.

A231881 The digits of a(n) and a(n+1) together can be reordered to form a square; lexicographically earliest sequence of distinct positive integers with this property.

This page as a plain text file.
%I A231881 #21 Nov 19 2013 14:13:44
%S A231881 1,6,3,16,9,4,14,8,29,5,2,11,25,12,15,21,37,69,13,27,19,26,10,24,30,
%T A231881 42,39,52,20,34,18,28,81,43,36,31,48,7,56,47,61,33,46,17,23,40,32,49,
%U A231881 60,57,22,45,63,54,67,41,38,44,62,55,126,58,108,76,50,92,35,64
%N A231881 The digits of a(n) and a(n+1) together can be reordered to form a square; lexicographically earliest sequence of distinct positive integers with this property.
%C A231881 A231880 and A231881 eventually merge: A231881(2539) = 2541; A231880(2540) = 2536; A231881(2540,2541,..) = A231880(2541,2542,..) = 2544,2551,.. _Hans Havermann_, Nov 17 2013
%H A231881 Hans Havermann, <a href="/A231881/b231881.txt">Table of n, a(n) for n = 0..10000</a>
%t A231881 a[0] = 1; a[n_] := a[n] = Block[{k = 1, idm = IntegerDigits@ a[n - 1], t = a@# & /@ Range[0, n - 1]}, Label[start]; While[ MemberQ[t, k], k++]; While[ Select[ Permutations[ Join[idm, IntegerDigits[ k]]], #[[1]] != 0 && IntegerQ[ Sqrt[ FromDigits[ #]]] &] == {}, k++; Goto[start]]; k]; Array[a, 100, 0] (* _Robert G. Wilson v_, Nov 17 2013 *)
%Y A231881 A variant of A228407. Cf. A231880.
%K A231881 nonn,base
%O A231881 0,2
%A A231881 _N. J. A. Sloane_, Nov 17 2013, based on a posting to the Sequence Fans Mailing List by _Andrew Weimholt_, Nov 12 2013
%E A231881 Corrected and extended by _Hans Havermann_, Nov 17 2013