cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A233783 The smallest prime that produces a set of n primes such that every prime after the first one is equal to the previous minus the product of its nonzero digits.

Original entry on oeis.org

2, 23, 251, 347, 5023, 50227, 64037, 3924211, 4952767, 43275737, 586635689, 592856489, 62527264517
Offset: 1

Views

Author

Carlos Rivera, Dec 15 2013

Keywords

Comments

a(14) > 6.8*10^11. - Giovanni Resta, Dec 16 2013

Examples

			Example: for n = 3, initial prime is 251, because 251 -> 251 - 2*5*1 = 241 -> 241 - 2*4*1 -> 233.
		

Crossrefs

Extensions

a(11)-a(13) from Giovanni Resta, Dec 16 2013

A235680 The smallest first term of a sequence of n primes such that, after the first, each is equal to the previous prime plus the sum of all of its digits, plus the product of all of its nonzero digits.

Original entry on oeis.org

2, 191, 163, 151, 127, 1644997, 36778597, 935715673, 50682890749, 16390560362269, 63334172492839
Offset: 1

Views

Author

Carlos Rivera, Jan 13 2014

Keywords

Comments

The following term produced in each sequence after the n-th is necessarily a composite integer.

Examples

			Example for n=8: a(8)=935715673 because after it the seven primes are 936311069, 936337351, 936490481, 936677149, 938391809, 938811763 and 939029537, with 936311069 = 935715673 + 9*3*5*7*1*5*6*7*3+(9+3+5+7+1+5+6+7+3) and so on...
		

Crossrefs

Extensions

a(9) from Giovanni Resta, Jan 13 2014
a(10)-a(11) from Giovanni Resta, Feb 22 2014
Showing 1-2 of 2 results.