The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A225901 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A225901

Write n in factorial base, then replace each nonzero digit d of radix k with k-d.
(history; published version)

#72 by Andrew Howroyd at Sat Apr 25 13:07:11 EDT 2020

STATUS

reviewed

approved

#71 by Michel Marcus at Sat Apr 25 12:52:07 EDT 2020

STATUS

proposed

reviewed

#70 by F. Chapoton at Sat Apr 25 12:42:44 EDT 2020

STATUS

editing

proposed

#69 by F. Chapoton at Sat Apr 25 12:42:34 EDT 2020

PROG

n=int(n//k)

print ([a(n) for n in range(101)] ) # Indranil Ghosh, Jun 19 2017

STATUS

approved

editing

Discussion

Sat Apr 25

12:42

F. Chapoton: adapt python code to python3

#68 by N. J. A. Sloane at Sat Dec 07 12:18:26 EST 2019

PROG

print [a(n) for n in xrangerange(101)] # Indranil Ghosh, Jun 19 2017

Discussion

Sat Dec 07

12:18

OEIS Server: https://oeis.org/edit/global/2837

#67 by Jon E. Schoenfield at Sat Sep 09 19:35:44 EDT 2017

STATUS

editing

approved

#66 by Jon E. Schoenfield at Sat Sep 09 19:35:41 EDT 2017

COMMENTS

Thus this permutation maps between polynomial encodings A275734 & A275735 and all the respective sequences obtained from them, where the former set of sequences are concerned with the "slopes" and the latter set with the "levels" of the factorial base representation. See the Crossrefs- section.

STATUS

approved

editing

#65 by Bruno Berselli at Mon Jun 19 03:36:00 EDT 2017

STATUS

proposed

approved

#64 by Indranil Ghosh at Mon Jun 19 01:13:37 EDT 2017

STATUS

editing

proposed

#63 by Indranil Ghosh at Mon Jun 19 01:13:19 EDT 2017

PROG

(Python)

from sympy import factorial as f

def a(n):

s=0

k=2

while(n):

d=n%k

n=int(n/k)

if d: s=s+(k - d)*f(k - 1)

k+=1

return s

print [a(n) for n in xrange(101)] # Indranil Ghosh, Jun 19 2017

STATUS

approved

editing