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.

A275946 Number of nonzero digits that are the sole occupants of their slope in factorial base representation: a(n) = A056169(A275734(n)). (See comments for more exact definition.)

This page as a plain text file.
%I A275946 #36 Dec 03 2021 18:10:11
%S A275946 0,1,1,2,1,0,1,2,2,3,2,1,1,2,0,1,2,1,1,0,2,1,0,0,1,2,2,3,2,1,2,3,3,4,
%T A275946 3,2,2,3,1,2,3,2,2,1,3,2,1,1,1,2,2,3,2,1,0,1,1,2,1,0,2,3,1,2,3,2,2,1,
%U A275946 3,2,1,1,1,2,0,1,2,1,2,3,1,2,3,2,0,1,0,1,1,0,2,1,1,0,1,1,1,0,2,1,0,0,2,1,3,2,1,1,2,1,1,0,1,1,0,0,1,1,0,0,1
%N A275946 Number of nonzero digits that are the sole occupants of their slope in factorial base representation: a(n) = A056169(A275734(n)). (See comments for more exact definition.)
%C A275946 Total number of such nonzero digits d_x in the factorial base representation (A007623) of n for which it holds that for all other nonzero digits d_y present (i_x - d_x) <> (i_y - d_y), where i_x and i_y are the indices of the digits d_x and d_y respectively.
%C A275946 Equally: Number of digit slopes occupied by just one nonzero digit in the factorial base representation of n. In other words, a(n) is the number of elements with multiplicity one in multiset [(i_x - d_x) | where d_x ranges over each nonzero digit present and i_x is its position from the right].
%H A275946 Antti Karttunen, <a href="/A275946/b275946.txt">Table of n, a(n) for n = 0..40320</a>
%H A275946 Indranil Ghosh, <a href="/A275946/a275946.txt">Python program for generating this sequence</a>
%H A275946 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%F A275946 a(n) = A056169(A275734(n)).
%F A275946 Other identities. For all n >= 0.
%F A275946 a(n) = A275948(A225901(n)).
%F A275946 A060502(n) = a(n) + A275947(n).
%F A275946 A060130(n) = a(n) + A275962(n).
%e A275946 For n=2, in factorial base "10", there is only one slope occupied by a single nonzero digit (1 is on the sub-maximal slope as 2-1 = 1), thus a(2) = 1.
%e A275946 For n=3, in factorial base "11", there are two occupied slopes, each having just one digit present, thus a(3) = 2.
%e A275946 For n=5, in factorial base "21", there is just one distinct occupied slope, but it contains two nonzero digits (2 and 1 both occupy the maximal slope as 2-2 = 1-1 = 0), thus there are no slopes with just one nonzero digit and a(5) = 0.
%e A275946 For n=525, in factorial base "41311", there are three occupied slopes. The maximal slope contains the nonzero digits "3.1", the sub-maximal digits "4..1.", and the sub-sub-sub-maximal just "1..." (the 1 in the position 4 from right is the sole occupier of its own slope). Thus only one of the slopes is occupied by a lonely occupant and a(525) = 1.
%o A275946 (Scheme) (define (A275946 n) (A056169 (A275734 n)))
%Y A275946 Cf. A056169, A275734.
%Y A275946 Cf. also A060502, A060130, A225901, A275947, A275948, A275962.
%K A275946 nonn,base
%O A275946 0,4
%A A275946 _Antti Karttunen_, Aug 15 2016