login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175923 Index of the first occurrence of p(n)-1 consecutive zeros in the sequence of Bell numbers reduced modulo the n-th prime p(n). 0
2, 8, 587, 114382, 25678050356, 23136292864687, 48471109094902544777, 103805969587115219182432, 905970719001665604796396056038, 88427967009378444685165002293032443131447 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
J. W. Layman, Maximum Strings of Bell Numbers Modulo Primes, J. Combin. Theory, Series A, 40 (1985) 161-168.
LINKS
FORMULA
a(n)=(p^p - 1)/(p - 1) + 1 - (p^p - p)/(p - 1)^2, where p is the n-th prime.
EXAMPLE
The Bell numbers, A000110, begin {1,1,2,5,15,52,203,877,4140,21147,115975,...} for n=0,1,2,...; modulo the second prime p(2)=3, these are {1,1,2,2,0,1,2,1,0,0,1, ...}, with the first p(2)-1=2 consecutive zeros beginning at n=8. Thus a(2)=8.
CROSSREFS
Sequence in context: A023365 A262826 A013554 * A356202 A076985 A120802
KEYWORD
nonn
AUTHOR
John W. Layman, Oct 18 2010
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)