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.

A302851 Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = A225901(1+A225901(n-1)).

This page as a plain text file.
%I A302851 #9 Dec 23 2024 14:53:45
%S A302851 0,1,4,3,18,5,2,7,10,9,96,11,8,13,16,15,6,17,14,19,22,21,12,23,20,25,
%T A302851 28,27,42,29,26,31,34,33,600,35,32,37,40,39,30,41,38,43,46,45,36,47,
%U A302851 44,49,52,51,66,53,50,55,58,57,24,59,56,61,64,63,54,65,62,67,70,69,60,71,68,73,76,75,90,77,74,79,82,81,48,83,80
%N A302851 Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = A225901(1+A225901(n-1)).
%H A302851 Antti Karttunen, <a href="/A302851/b302851.txt">Table of n, a(n) for n = 0..10079</a>
%H A302851 David Newman, et al., <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2018-January/018239.html">New sequences from old, Discussion on SeqFan-mailing list</a>, January 2018.
%H A302851 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%H A302851 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A302851 a(0) = 0; for n >= 1, a(n) = A225901(1+A225901(n-1)).
%o A302851 (PARI)
%o A302851 A225901(n) = { my(s=0, d, k=2); while(n, d=n%k; n=n\k; if(d, s += (k-d)*(k-1)!); k=k+1); (s); };
%o A302851 A302851(n) = if(!n,n,A225901(1+A225901(n-1)));
%Y A302851 Cf. A302852 (inverse).
%Y A302851 Cf. A225901.
%K A302851 nonn,base
%O A302851 0,3
%A A302851 _Antti Karttunen_, Apr 26 2018