login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A255341
Numbers n such that there is exactly one 1 in their factorial base representation (A007623).
6
1, 2, 5, 6, 10, 13, 14, 17, 19, 20, 23, 24, 28, 36, 40, 42, 46, 49, 50, 53, 54, 58, 61, 62, 65, 67, 68, 71, 73, 74, 77, 78, 82, 85, 86, 89, 91, 92, 95, 97, 98, 101, 102, 106, 109, 110, 113, 115, 116, 119, 120, 124, 132, 136, 138, 142, 168, 172, 180, 184, 186, 190, 192, 196, 204, 208, 210
OFFSET
1,2
LINKS
EXAMPLE
The factorial base representation (A007623) of 5 is "21", which contains exactly one 1, thus 5 is included in the sequence.
The f.b.r. of 23 is "321", with only one 1, thus 23 is included in the sequence.
The f.b.r. of 24 is "1000", with only one 1, thus 24 is included in the sequence.
MATHEMATICA
factBaseIntDs[n_] := Module[{m, i, len, dList, currDigit}, i = 1; While[n > i!, i++]; m = n; len = i; dList = Table[0, {len}]; Do[currDigit = 0; While[m >= j!, m = m - j!; currDigit++]; dList[[len - j + 1]] = currDigit, {j, i, 1, -1}]; If[dList[[1]] == 0, dList = Drop[dList, 1]]; dList]; s = Table[FromDigits[factBaseIntDs[n]], {n, 210}]; {0}~Join~Flatten@ Position[s, x_ /; DigitCount[x][[1]] == 1] (* Michael De Vlieger, Apr 27 2015, after Alonso del Arte at A007623 *)
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
(define A255341 (MATCHING-POS 1 0 (lambda (n) (= 1 (A257511 n)))))
CROSSREFS
Subsequence of A256450.
Subsequences: A000142, A033312 (apart from its zero-terms).
Sequence in context: A162340 A212016 A212015 * A089269 A047440 A255055
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Apr 27 2015
STATUS
approved