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.

A231924 Working in base 5: a(0)=0, thereafter a(n+1) is the smallest number not already in the sequence such that the bits of a(n) and a(n+1) together can be rearranged to form a palindrome.

This page as a plain text file.
%I A231924 #7 Nov 16 2013 14:15:28
%S A231924 0,11,1,10,100,12,2,20,101,22,3,13,31,103,30,110,33,4,14,41,104,40,
%T A231924 114,24,42,112,21,102,120,201,210,1000,111,44,113,23,32,121,200,211,
%U A231924 222,233,244,323,332,424,442,1001,122,133,144,212,221,313,331,414,441,1002,123
%N A231924 Working in base 5: a(0)=0, thereafter a(n+1) is the smallest number not already in the sequence such that the bits of a(n) and a(n+1) together can be rearranged to form a palindrome.
%C A231924 This is a permutation of the nonnegative integers in base 5 - see the Comments in A228407 for the proof.
%t A231924 a[0] = 0; a[n_] := a[n] = Block[{k = 1, idm = IntegerDigits[ a[n - 1], 5], t = a@# & /@ Range[n - 1]}, Label[ start]; While[ MemberQ[t, k], k++];  While[ Select[ Permutations[ Join[ idm, IntegerDigits[k, 5]]], #[[1]] != 0 && # == Reverse@# &] == {}, k++; Goto[ start]]; k]; s = Array[a, 60, 0]; FromDigits@# & /@ IntegerDigits[s, 5]
%Y A231924 Cf. A230891, A231920, A231922, A231926, A231928, A231930, A231932, A228407, A231925.
%K A231924 nonn,base,easy
%O A231924 0,2
%A A231924 _N. J. A. Sloane_ and _Robert G. Wilson v_, Nov 15 2013