|
| |
|
|
A032924
|
|
Numbers whose ternary expansion contains no 0.
|
|
15
|
|
|
|
1, 2, 4, 5, 7, 8, 13, 14, 16, 17, 22, 23, 25, 26, 40, 41, 43, 44, 49, 50, 52, 53, 67, 68, 70, 71, 76, 77, 79, 80, 121, 122, 124, 125, 130, 131, 133, 134, 148, 149, 151, 152, 157, 158, 160, 161, 202, 203, 205, 206, 211, 212, 214, 215, 229, 230, 232, 233, 238, 239
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
Complement of A081605. - Reinhard Zumkeller, Mar 23 2003
a(n) = A107680(n) + A107681(n); - Reinhard Zumkeller, May 20 2005
A081604(A107681(n)) <= A081604(A107680(n)) = A081604(a(n)) = A000523(n+1). - Reinhard Zumkeller, May 20 2005
A077267(a(n)) = 0. - Reinhard Zumkeller, Mar 02 2008
Subsequence of A154314. [From Reinhard Zumkeller, Jan 07 2009]
A212193(a(n)) = 0. [Reinhard Zumkeller, May 04 2012]
|
|
|
REFERENCES
|
David Garth and Adam Gouge, Affinely Self-Generating Sets and Morphisms, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.5.
C. Kimberling, Affinely recursive sets and orderings of languages, Discrete Math., 274 (2004), 147-160. [From N. J. A. Sloane, Jan 31 2012]
|
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
|
a(1)=1, a(n+1)=f(a(n)+1,f(a(n)+1) where f(x,y) = if x<3 and x<>0 then y else if x mod 3 = 0 then f(y+1,y+1) else f(floor(x/3),y). - Reinhard Zumkeller, Mar 02 2008
a(2n)=a(2n-1)+1, n>0. [From Zak Seidov, Jul 27 2009]
|
|
|
PROG
|
(Haskell)
import Data.List (elemIndices)
a032924 n = a032924_list !! (n-1)
a032924_list = elemIndices 0 a212193_list
-- Reinhard Zumkeller, May 04 2012
|
|
|
CROSSREFS
|
Cf. A005823, A005836, A007089, A081608.
Cf. A132140, A132141.
Sequence in context: A176193 A072920 A107899 * A005125 A082672 A187054
Adjacent sequences: A032921 A032922 A032923 * A032925 A032926 A032927
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
Clark Kimberling
|
|
|
STATUS
|
approved
|
| |
|
|
