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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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: A222175 A265360 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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 2 12:56 EST 2016. Contains 278678 sequences.