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!)
A046850 Gilda's primes: primes in A042947. 1
29, 683, 997, 2207, 30571351 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Is this sequence infinite?

LINKS

Table of n, a(n) for n=1..5.

Russo, F. A Set of New Smarandache Functions, Sequences and Conjectures in Number Theory., Lupton, AZ: American Research Press, 2000.

PROG

(PARI) for(n=1, 10^8, if(isprime(n), s=eval(Vec(Str(n))); f1=sum(i=1, #s, s[i]); f0=abs(2*s[1]-f1); f=f0+f1; while(f<=n, if(f==n, print1(n", "); break); f0=f1; f1=f; f=f0+f1))) - Herman Jamke (hermanjamke(AT)fastmail.fm), Mar 30 2008

CROSSREFS

Cf. A042947.

Sequence in context: A063044 A062560 A135995 * A180844 A159669 A162831

Adjacent sequences:  A046847 A046848 A046849 * A046851 A046852 A046853

KEYWORD

nonn,base,less

AUTHOR

Felice Russo

EXTENSIONS

One more term from Herman Jamke (hermanjamke(AT)fastmail.fm), Mar 30 2008

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 4 13:26 EST 2016. Contains 278750 sequences.