login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026601 a(n) = n-th number k such that s(k) = 1, where s = A026600. 4
1, 6, 8, 12, 14, 16, 20, 22, 27, 30, 32, 34, 38, 40, 45, 46, 51, 53, 56, 58, 63, 64, 69, 71, 75, 77, 79, 84, 86, 88, 92, 94, 99, 100, 105, 107, 110, 112, 117, 118, 123, 125, 129, 131, 133, 136, 141, 143, 147, 149, 151, 155, 157, 162 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

It appears that a(n) gives the position of its own n-th 1 modulo 3 term, the n-th 2 modulo 3 term in A026602, and the n-th multiple of 3 in A026603. A026602 and A026603 appear to have analogous indexical properties. [From Matthew Vandermast, Oct 06 2010]

LINKS

Table of n, a(n) for n=1..54.

CROSSREFS

Equals A079498(n-2) + 1.

Sequence in context: A183979 A222175 A182253 * A243937 A242058 A109138

Adjacent sequences:  A026598 A026599 A026600 * A026602 A026603 A026604

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 26 20:33 EST 2014. Contains 250119 sequences.