The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A338295 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A338295

For n > 1, a(n) is the largest base b <= n such that the digits of n in base b contain the digit b-1; a(1) = 1.
(history; published version)

#35 by Peter Luschny at Wed Dec 16 17:42:14 EST 2020

STATUS

reviewed

approved

#34 by Peter Luschny at Wed Dec 16 07:46:18 EST 2020

STATUS

proposed

reviewed

#33 by Peter Luschny at Wed Dec 16 07:46:14 EST 2020

STATUS

editing

proposed

#32 by Peter Luschny at Wed Dec 16 07:45:35 EST 2020

FORMULA

a(n) = (n + 1)/p lpf(n + 1) if n + 1 is composite, where p lpf(n) is the smallest least prime dividing n+1, A020639. - Devansh Singh, Dec 06 2020

CROSSREFS

Cf. A337496, A337535, A020639.

STATUS

reviewed

editing

#31 by Andrew Howroyd at Tue Dec 15 20:15:18 EST 2020

STATUS

proposed

reviewed

#30 by Andrew Howroyd at Tue Dec 15 20:15:09 EST 2020

STATUS

editing

proposed

#29 by Andrew Howroyd at Tue Dec 15 20:14:47 EST 2020

FORMULA

a(n) = (n+1)/p if n+1 is not prime, composite, where p is the smallest prime dividing n+1. - Devansh Singh, Dec 06 2020

STATUS

proposed

editing

#28 by Devansh Singh at Mon Dec 07 06:08:04 EST 2020

STATUS

editing

proposed

Discussion

Mon Dec 07

21:58

Devansh Singh: Why ceil(sqrt(n+1))?

#27 by Devansh Singh at Mon Dec 07 06:07:51 EST 2020

FORMULA

a(n) = (n+1)/p if n+1 is not prime, where p is the smallest prime dividing n+1. - Devansh Singh, Dec 06 2020

#26 by Devansh Singh at Mon Dec 07 06:06:32 EST 2020

FORMULA

a(n) = (n+1)/p if n+1 is not prime, where p is the smallest prime dividing n+1 and n+1 is not prime. - Devansh Singh, Dec 06 2020

STATUS

proposed

editing