Search: a023806 -id:a023806
|
| |
|
|
A113763
|
|
Non-multiples of 13, or numbers not divisible by 13.
|
|
+10
5
|
|
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
Cf. A011760 (Elevator buttons in U.S.A).
Cf. A023806 (all digits in base 12 are different).
|
|
|
LINKS
|
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,0,0,1,-1).
|
|
|
FORMULA
|
a(n) = n+floor((2n-1)/24) = n+quotient(2n-1, 24)
|
|
|
MATHEMATICA
|
Table[n+Quotient[2n-1, 24], {n, 1, 85}]; (* or *)Table[n+Floor[(2n-1)/24], {n, 1, 85}]
|
|
|
PROG
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
| |
|
|
A043286
|
|
Maximal run length in base-12 representation of n.
|
|
+10
4
|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,13
|
|
|
COMMENTS
|
For all numbers n in A023806, a(n)=1, but this holds also for others, e.g., n=145, not in A023806. The same relation holds for the terms of A113763 less than n=144, but becomes wrong from then on. - M. F. Hasler, Jul 24 2013
|
|
|
LINKS
|
|
|
|
MATHEMATICA
|
|
|
|
PROG
|
(PARI) A043286(n, b=12){=my(m, c=1); while(n>0, n%b==(n\=b)%b&&c++&&next; m=max(m, c); c=1); m} \\ M. F. Hasler, Jul 23 2013 - typos fixed by Antti Karttunen, Dec 06 2017
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
Search completed in 0.009 seconds
|
