login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A302851 Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = A225901(1+A225901(n-1)). 2

%I #8 Jan 02 2023 12:30:54

%S 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 28,27,42,29,26,31,34,33,600,35,32,37,40,39,30,41,38,43,46,45,36,47,

%U 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 Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = A225901(1+A225901(n-1)).

%H Antti Karttunen, <a href="/A302851/b302851.txt">Table of n, a(n) for n = 0..10079</a>

%H David Newman, et al., <a href="http://list.seqfan.eu/oldermail/seqfan/2018-January/018239.html">New sequences from old, Discussion on SeqFan-mailing list</a>, January 2018.

%H <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>

%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>

%F a(0) = 0; for n >= 1, a(n) = A225901(1+A225901(n-1)).

%o (PARI)

%o 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(n) = if(!n,n,A225901(1+A225901(n-1)));

%Y Cf. A302852 (inverse).

%Y Cf. A225901.

%K nonn,base

%O 0,3

%A _Antti Karttunen_, Apr 26 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)