Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007952
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007952 Generated by a sieve: keep first number, drop every 2nd, keep first, drop every 3rd, keep first, drop every 4th, etc. +0
18
0, 1, 3, 5, 9, 11, 17, 21, 29, 33, 41, 47, 57, 59, 77, 81, 101, 107, 117, 131, 149, 153, 173, 191, 209, 213, 239, 257, 273, 281, 321, 329, 359, 371, 401, 417, 441, 453, 497, 509, 539, 569, 611, 621, 647, 671, 717, 731, 779, 801, 839, 869, 917, 929, 989, 1001, 1053, 1067 (list; graph; listen)
OFFSET

0,3

COMMENT

Also called the sieve of Tchoukaillon (or Mancala, or Kalahari); also the Smarandache consecutive sieve.

If k+1 occurs at rank i for the first time, then i is given by the program: i = 0: for j = k to 1 step -1: i = 1 + i + int ( i / j ): next: - Claude Lenormand (claude.lenormand(AT)free.fr), Jan 15 2001

A082447(n+1) = (number of terms <= n); see A141262 for primes. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 21 2008

REFERENCES

D. Betten, Kalahari and the Sequence "Sloane No. 377", Annals Discrete Math., 37, 51-58, 1988.

Y. David, On a sequence generated by a sieving process, Riveon Lematematika, 11 (1957), 26-31.

P. Erdos and E. Jabotinsky, On a sequence of integers ..., Indagationes Math., 20, 115-128, 1958.

M. Le, On the Smarandache n-ary Sieve, Smarandache Notions Journal, Vol. 10, No. 1-2-3, 1999, 146-147.

F. Smarandache, "Only Problems, Not Solutions!", Xiquan Publ., Phoenix and Chicago, 1993.

LINKS

L. K. Mitchell, Table of n, a(n) for n=0..7549

D. M. Broline and D. E. Loeb (daniel.loeb(AT)verizon.net), The combinatorics of Mancala-Type games: Ayo, Tchoukaillon and 1/Pi, J. Undergrad. Math. Applic., vol. 16 (1995), pp. 21-36.

M. L. Perez et al., eds., Smarandache Notions Journal

N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).

F. Smarandache, Only Problems, Not Solutions!

Index entries for sequences generated by sieves

FORMULA

Equals A002491(n) - 1. Equals A108696 - 2.

CROSSREFS

Cf. A002491, A007952, A028920, A028931, A028932, A028933.

Cf. A108696, A140060, A141271, A141272.

Sequence in context: A117992 A015614 A138203 this_sequence A145819 A094509 A120811

Adjacent sequences: A007949 A007950 A007951 this_sequence A007953 A007954 A007955

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), R. Muller

EXTENSIONS

Corrected and extended by David W. Wilson (davidwwilson(AT)comcast.net).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research